Vehicle Routing Problem with Simultaneous Pickup and Delivery and Maximum Tour Time Length Constraint

Please enable javascript in your browser.

Keshvari Fard, Milad | 2011

723 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 41877 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Akbari Jokar, Mohammad Reza
Abstract:
The Vehicle Routing Problem with Simultaneous Pick-up and Delivery (VRPSPD) and maximum time for traversing of each tour is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous delivery and pick-up. Deliveries are supplied from a single depot at the beginning of the vehicle’s service, while pick-up loads are taken to the same depot at the conclusion of the service. Also the required time for traversing each route should not encroach the specified limit.
In this research, the aforesaid problem was introduced and a mixed integer programming model developed for it. Because of being NP-Hard and impossibility of solving it in the large instances, two algorithms of Tabu Search and Simulated Annealing were developed to handle the problem. For producing the initial solution for these two algorithms, three methods were generated. Furthermore, five procedures for improving the solution were developed, which three of them are using for inter-route and the other two for intra-route improvement. Computational results were reported for 26 produced test problems of the size between 5 to 200 customers
Keywords:
Tabu Search Algorithm ; Simulated Annealing Method ; Vehicle Routing Problem with Simultaneous Pickup and Delivery ; Maximum Tour Time Length

No TOC