Archives and Documentation Center
Digital Archives

Adaptive large neighbourhood search heuristic on vehicle routing problem with drones and time windows

Show simple item record

dc.contributor Graduate Program in Industrial Engineering.
dc.contributor.advisor Aras, Necati.
dc.contributor.author Yiğit, Arifcan.
dc.date.accessioned 2023-03-16T10:29:58Z
dc.date.available 2023-03-16T10:29:58Z
dc.date.issued 2020.
dc.identifier.other IE 2020 Y54
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/13434
dc.description.abstract Last-mile deliveries are the most costly and time-consuming part of the supply chain. Advancements in drone technology resulted in cheaper and faster drones capable of parcel delivery. However, their range is quite limited for drone-only delivery. Using synchronized drones and trucks could lower costs and delivery times by combining their superior features. This thesis addresses Vehicle Routing Problem with Drones and Time Windows (VRPDTW). The problem is formulated with waiting time restrictions on drones and cost minimization objective. Due to NP-hard nature of the problem, exact solution methods are ine cient even for small instances. Therefore, we develop an Adaptive Large Neighbourhood Search (ALNS) heuristic for nding near optimal solutions. Numerical experiments are conducted to measure the e ectiveness of the heuristic using small and medium-sized instances generated randomly. Results show that the proposed heuristic is able to nd optimal or near optimal solutions in small instances.
dc.format.extent 30 cm.
dc.publisher Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2020.
dc.subject.lcsh Drone aircraft.
dc.subject.lcsh Business logistics.
dc.title Adaptive large neighbourhood search heuristic on vehicle routing problem with drones and time windows
dc.format.pages xii, 53 leaves ;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account