• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Industrial Engineering
      • Dept. of Industrial Engineering - Master's degree
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Optimization of last-mile deliveries with synchronous truck and drones

      Thumbnail
      Embargo Lift Date: 2021-02-10
      View / Download
      498.7 Kb
      Author
      Özel, Aysu
      Advisor
      Yetiş, Bahar
      Date
      2020-08
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      95
      views
      10
      downloads
      Abstract
      Deployment of drones in delivery operations has been attracting a growing interest from commercial sector due to its prospective advantages for the distribution systems. Motivated by the widespread adoption of drones in last-mile delivery, we introduce the minimum cost traveling salesman problem with multiple drones, where a truck and multiple drones work in synchronization to deliver parcels to customers. In this problem, we aim to find an optimal delivery plan for the truck and drones operating in tandem with the objective of minimizing the total operational cost including the vehicles’ operating and waiting costs. We provide flow based and cut based mixed integer linear programming formulations along with valid inequalities. Since the connectivity constraints in the cut based formulation and the proposed valid inequalities are exponential in the size of the problem, we devise different branch-and-cut schemes to solve our problem. We also provide an alternative solution methodology using another cut based formulation with undirected route variables. To compare our formulations/algorithms and to demonstrate their competitiveness, we conduct computational experiments on a set of instances. The results indicate the superiority of utilizing branch-and-cut methodology over flow based formulation and good computational performance of the proposed algorithms in comparison to existing exact solution approaches in the literature. We also conduct sensitivity analyses on problem parameters and discuss their effects on the optimal solutions.
      Keywords
      Traveling salesman problem
      Delivery
      Drones
      Synchronization
      Branch-and-cut
      Permalink
      http://hdl.handle.net/11693/53949
      Collections
      • Dept. of Industrial Engineering - Master's degree 326
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy