{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/127078"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/127078","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Decentralized resource allocation for synchronized tasks through Adaptive Large Neighborhood Search (ALNS)","abstract":"This thesis explores a method for multiple suppliers to coordinate resource scheduling of task requests from multiple consumers using decentralized planning. A time window is associated with each task and some tasks require simultaneous servicing from multiple resources of specified classes to fulfil a request. The suppliers create schedules for their resources that maximize the value of all tasks fulfilled, while minimizing travel cost, and respecting all time window constraints. This thesis presents Infeasibility Cooling Adaptive Allocation for Resource United Scheduling (ICAARUS), a novel Adaptive Large Neighborhood Search (ALNS) algorithm that is capable of synchronizing tasks across a variable number of resources. A supplier's individual schedule and cost function is kept private from consumers. An e-commerce style of multi-round bidding is introduced to notify suppliers of resource request parameters and to allow consumers to synchronize resources from independent suppliers. A Mixed-Integer Linear Program (MILP) is used by the consumer to select the least costly bids that can be combined to fulfill a task's requirements.","abstract_html":"This thesis explores a method for multiple suppliers to coordinate resource scheduling of task requests from multiple consumers using decentralized planning. A time window is associated with each task and some tasks require simultaneous servicing from multiple resources of specified classes to fulfil a request. The suppliers create schedules for their resources that maximize the value of all tasks fulfilled, while minimizing travel cost, and respecting all time window constraints. This thesis presents Infeasibility Cooling Adaptive Allocation for Resource United Scheduling (ICAARUS), a novel Adaptive Large Neighborhood Search (ALNS) algorithm that is capable of synchronizing tasks across a variable number of resources. A supplier's individual schedule and cost function is kept private from consumers. An e-commerce style of multi-round bidding is introduced to notify suppliers of resource request parameters and to allow consumers to synchronize resources from independent suppliers. A Mixed-Integer Linear Program (MILP) is used by the consumer to select the least costly bids that can be combined to fulfill a task's requirements.","abstract_has_math":false,"creators":["Montgomery, Christian D.(Christian Donovan)"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Aeronautics and Astronautics","school":null,"contributors":[],"advisors":["Hamsa Balakrishnan."],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-22T22:21:16Z","subjects":["Aeronautics and Astronautics."],"languages":["eng"],"rights":["MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/127078","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hamsa Balakrishnan."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Aeronautics and Astronautics","Aero"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Aeronautics and Astronautics."]},{"key":"dc:creator","label":"Author","values":["Montgomery, Christian D.(Christian Donovan)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-09-03T17:45:49Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-09-03T17:45:49Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Aeronautics and Astronautics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/127078"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, May, 2020","Cataloged from the official PDF of thesis.","Includes bibliographical references (pages 91-93)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis explores a method for multiple suppliers to coordinate resource scheduling of task requests from multiple consumers using decentralized planning. A time window is associated with each task and some tasks require simultaneous servicing from multiple resources of specified classes to fulfil a request. The suppliers create schedules for their resources that maximize the value of all tasks fulfilled, while minimizing travel cost, and respecting all time window constraints. This thesis presents Infeasibility Cooling Adaptive Allocation for Resource United Scheduling (ICAARUS), a novel Adaptive Large Neighborhood Search (ALNS) algorithm that is capable of synchronizing tasks across a variable number of resources. A supplier's individual schedule and cost function is kept private from consumers. An e-commerce style of multi-round bidding is introduced to notify suppliers of resource request parameters and to allow consumers to synchronize resources from independent suppliers. A Mixed-Integer Linear Program (MILP) is used by the consumer to select the least costly bids that can be combined to fulfill a task's requirements."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Decentralized resource allocation for synchronized tasks through Adaptive Large Neighborhood Search (ALNS)"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hamsa Balakrishnan."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Aeronautics and Astronautics","Aero"],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Aeronautics and Astronautics."],"dc:creator":["Montgomery, Christian D.(Christian Donovan)"],"dc:date.accessioned":["2020-09-03T17:45:49Z"],"dc:date.available":["2020-09-03T17:45:49Z"],"dc:date.issued":["2020"],"dc:description":["Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, May, 2020","Cataloged from the official PDF of thesis.","Includes bibliographical references (pages 91-93)."],"dc:description.abstract":["This thesis explores a method for multiple suppliers to coordinate resource scheduling of task requests from multiple consumers using decentralized planning. A time window is associated with each task and some tasks require simultaneous servicing from multiple resources of specified classes to fulfil a request. The suppliers create schedules for their resources that maximize the value of all tasks fulfilled, while minimizing travel cost, and respecting all time window constraints. This thesis presents Infeasibility Cooling Adaptive Allocation for Resource United Scheduling (ICAARUS), a novel Adaptive Large Neighborhood Search (ALNS) algorithm that is capable of synchronizing tasks across a variable number of resources. A supplier's individual schedule and cost function is kept private from consumers. An e-commerce style of multi-round bidding is introduced to notify suppliers of resource request parameters and to allow consumers to synchronize resources from independent suppliers. A Mixed-Integer Linear Program (MILP) is used by the consumer to select the least costly bids that can be combined to fulfill a task's requirements."],"dc:description.degree":["S.M."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/127078"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Aeronautics and Astronautics."],"dc:title":["Decentralized resource allocation for synchronized tasks through Adaptive Large Neighborhood Search (ALNS)"],"dc:type":["Thesis"],"thesis:degree_name":["Master"]},"updated_at":"2026-07-22T22:21:16Z"}