Metaheuristic algorithm for pickup and delivery vehicle route problems with time windows
CovenanteeNagaoka Gijutsu Kagaku Daigaku
Document typeMaster thesis
Rights accessOpen Access
This project tackles the study, the design, the implementation, and the analysis of the results of a metaheuristic algorithm for a vehicle route problem, in particular, for the pickup and delivery problem with time windows. This problem concerns the transportation of goods between paired pickup and delivery locations where the pickup locations must be visited before the corresponding delivery locations by the same vehicle. The project is divided into two parts. The first part is a theoretical part in which the Vehicle Route Problem (VRP) is introduced, and its different versions are explained. Moreover, the mathematical model for the Pickup and Delivery Problem with Time Windows (PDPTW) is formulated, and its functioning is analysed. The second part of the project is practical. It includes the design of a metaheuristic algorithm based on a tabu neighbourhood search. Later, this algorithm has been tested aiming the minimum travel distance. Finally, the quality of the results obtained have been analysed. Using the public data provided by Li & Lim Benchmark, the algorithm has been validated, and the results obtained have been compared with the ones provided by one of Europe’s largest independent research organizations known as SINTEF.
DegreeMÀSTER UNIVERSITARI EN ENGINYERIA INDUSTRIAL (Pla 2014)