{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/122401"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/122401","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A metaheuristic approach to optimizing a multimodal truck and drone delivery system","abstract":"The success of e-commerce continues to push the bounds of delivery services as customers expect near instant fulfillment at little additional cost. This demand for delivery performance and operational cost efficiency has led to the exploration of the last-mile delivery problem using creative multimodal delivery systems. One promising system consists of a truck that can carry and deploy multiple autonomous drones to assist in the fulfillment of customer demand. The contribution of this thesis is towards furthering the understanding of the application of autonomous flying drones in such a system and improve parcel delivery performance within the constraint of the current state of technology. This thesis explores the feasibility of deploying drones in last-mile delivery by modeling and then optimizing the cost of serving customers with a system consisting of one truck and multiple drones under multiple customer demand scenarios. While this optimization problem can be solved with mixed integer linear programming (MILP), the computation requirement is such that MILP is inefficient for real world scenarios with 100 or more customers. This research applies metaheuristic methodology to solve the truck-and-drone problem for scenarios with up to 158 customers in approximately 30 minutes of computation time. The test results confirm an average of 7% to 9% in savings opportunity for a 2-drone baseline over traditional single truck delivery tours. This savings opportunity is shown to vary with customer density, number of drones carried, range of drone flight, and speed of drone relative to speed of truck.","abstract_html":"The success of e-commerce continues to push the bounds of delivery services as customers expect near instant fulfillment at little additional cost. This demand for delivery performance and operational cost efficiency has led to the exploration of the last-mile delivery problem using creative multimodal delivery systems. One promising system consists of a truck that can carry and deploy multiple autonomous drones to assist in the fulfillment of customer demand. The contribution of this thesis is towards furthering the understanding of the application of autonomous flying drones in such a system and improve parcel delivery performance within the constraint of the current state of technology. This thesis explores the feasibility of deploying drones in last-mile delivery by modeling and then optimizing the cost of serving customers with a system consisting of one truck and multiple drones under multiple customer demand scenarios. While this optimization problem can be solved with mixed integer linear programming (MILP), the computation requirement is such that MILP is inefficient for real world scenarios with 100 or more customers. This research applies metaheuristic methodology to solve the truck-and-drone problem for scenarios with up to 158 customers in approximately 30 minutes of computation time. The test results confirm an average of 7% to 9% in savings opportunity for a 2-drone baseline over traditional single truck delivery tours. This savings opportunity is shown to vary with customer density, number of drones carried, range of drone flight, and speed of drone relative to speed of truck.","abstract_has_math":false,"creators":["Kuang, Yue(Yue Rick)"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Supply Chain Management Program","school":null,"contributors":[],"advisors":["Mohammad Moshref-Javadi."],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019","date_published":"2019","updated_at":"2026-07-22T22:21:42Z","subjects":["Supply Chain Management Program."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/122401","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Mohammad Moshref-Javadi."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Supply Chain Management Program","SCM"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Supply Chain Management Program."]},{"key":"dc:creator","label":"Author","values":["Kuang, Yue(Yue Rick)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-10-04T21:32:28Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-04T21:32:28Z"]},{"key":"dc:date.issued","label":"Date","values":["2019"]},{"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":["Supply Chain Management Program."]}]},{"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 are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"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/122401"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng. in Supply Chain Management, Massachusetts Institute of Technology, Supply Chain Management Program, 2019","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 50-51)."]},{"key":"dc:description.abstract","label":"Abstract","values":["The success of e-commerce continues to push the bounds of delivery services as customers expect near instant fulfillment at little additional cost. This demand for delivery performance and operational cost efficiency has led to the exploration of the last-mile delivery problem using creative multimodal delivery systems. One promising system consists of a truck that can carry and deploy multiple autonomous drones to assist in the fulfillment of customer demand. The contribution of this thesis is towards furthering the understanding of the application of autonomous flying drones in such a system and improve parcel delivery performance within the constraint of the current state of technology. This thesis explores the feasibility of deploying drones in last-mile delivery by modeling and then optimizing the cost of serving customers with a system consisting of one truck and multiple drones under multiple customer demand scenarios. While this optimization problem can be solved with mixed integer linear programming (MILP), the computation requirement is such that MILP is inefficient for real world scenarios with 100 or more customers. This research applies metaheuristic methodology to solve the truck-and-drone problem for scenarios with up to 158 customers in approximately 30 minutes of computation time. The test results confirm an average of 7% to 9% in savings opportunity for a 2-drone baseline over traditional single truck delivery tours. This savings opportunity is shown to vary with customer density, number of drones carried, range of drone flight, and speed of drone relative to speed of truck."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng. in Supply Chain Management"]},{"key":"dc:title","label":"Title","values":["A metaheuristic approach to optimizing a multimodal truck and drone delivery system"]}]}],"canonical_facts":{"dc:contributor.advisor":["Mohammad Moshref-Javadi."],"dc:contributor.department":["Massachusetts Institute of Technology. Supply Chain Management Program","SCM"],"dc:contributor.other":["Massachusetts Institute of Technology. Supply Chain Management Program."],"dc:creator":["Kuang, Yue(Yue Rick)"],"dc:date.accessioned":["2019-10-04T21:32:28Z"],"dc:date.available":["2019-10-04T21:32:28Z"],"dc:date.issued":["2019"],"dc:description":["Thesis: M. Eng. in Supply Chain Management, Massachusetts Institute of Technology, Supply Chain Management Program, 2019","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 50-51)."],"dc:description.abstract":["The success of e-commerce continues to push the bounds of delivery services as customers expect near instant fulfillment at little additional cost. This demand for delivery performance and operational cost efficiency has led to the exploration of the last-mile delivery problem using creative multimodal delivery systems. One promising system consists of a truck that can carry and deploy multiple autonomous drones to assist in the fulfillment of customer demand. The contribution of this thesis is towards furthering the understanding of the application of autonomous flying drones in such a system and improve parcel delivery performance within the constraint of the current state of technology. This thesis explores the feasibility of deploying drones in last-mile delivery by modeling and then optimizing the cost of serving customers with a system consisting of one truck and multiple drones under multiple customer demand scenarios. While this optimization problem can be solved with mixed integer linear programming (MILP), the computation requirement is such that MILP is inefficient for real world scenarios with 100 or more customers. This research applies metaheuristic methodology to solve the truck-and-drone problem for scenarios with up to 158 customers in approximately 30 minutes of computation time. The test results confirm an average of 7% to 9% in savings opportunity for a 2-drone baseline over traditional single truck delivery tours. This savings opportunity is shown to vary with customer density, number of drones carried, range of drone flight, and speed of drone relative to speed of truck."],"dc:description.degree":["M. Eng. in Supply Chain Management"],"dc:identifier.uri":["https://hdl.handle.net/1721.1/122401"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Supply Chain Management Program."],"dc:title":["A metaheuristic approach to optimizing a multimodal truck and drone delivery system"],"dc:type":["Thesis"],"thesis:degree_name":["Master"]},"updated_at":"2026-07-22T22:21:42Z"}