Vehicle Dispatch Scheduling with a Heterogeneous Fleet Considering Time Windows, Simultaneous Pickup and Delivery, and Split Delivery

Please enable javascript in your browser.

Feyzyab, Alireza | 2024

0 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 58358 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): Amini, Zahra
Abstract:
This research addresses the vehicle routing problem considering heterogeneous fleets, time windows, simultaneous pickup and delivery, and the possibility of split deliveries under real-time traffic conditions. The primary objective of this study is to develop a linear optimization model that can optimally allocate vehicles and routes while taking into account the aforementioned constraints. The branch and bound method is employed in CPLEX software to solve this complex problem. The last-mile delivery, as a significant challenge in the logistics field, is also specifically analyzed. The results indicate that the proposed model is capable of solving the vehicle routing problem efficiently and accurately, leading to reduced costs, delivery times, and overall fleet efficiency improvements
Keywords:
Vehicle Routing Problem ; Vehicle Routing Problem with Heterogeneous Fleet ; Time Window ; Last Mile Delivery ; Linear Programming ; Mixed Integer Linear Programming

No TOC