Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows
The vehicle routing problem with pickups, deliveries and time windows (PDPTW) is an important member in the class of vehicle routing problems. In this paper a general heuristic to construct an initial feasible solution is proposed and compared with other construction methods. New route reconstruction heuristics are then shown to improve on this. These reconstruction heuristics look to reorder individual routes and recombine multiple routes to decrease the number of vehicles used in the solution. A tabu search scheme where the attribute to be recorded has been specifically adapted to the PDPTW is proposed. A new method based on branch and bound optimisation attempts to optimise the final ordering of requests in routes to further improve the solutions. Results are analysed for a standard set of benchmark instances and are shown to be competitive with the state of the art.
KeywordsVehicle Routing pickup and delivery and tabu search
Unable to display preview. Download preview PDF.
- 7.Lau, H., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. In: The 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, USA, pp. 333–340 (2001)Google Scholar
- 8.Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: The 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, USA, pp. 160–167 (2001)Google Scholar
- 15.Lim, H., Lim, A., Rodrigues, B.: Solving the pickup and delivery problem with time windows using “squeaky wheel” optimization with local search. In: Proceedings of AMCIS 2002, pp. 2335–2344 (2002)Google Scholar
- 16.Carabetti, E., de Souza, S., Fraga, M.: An application of the ant colony system metaheuristic to the vehicle routing problem with pickup and delivery and time windows. In: Eleventh Brazilian Symposium on Neural Networks 2010, pp. 176–181 (2010)Google Scholar
- 17.Or, I.: Traveling salesman-type combinatorial problems and their relation the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL (1976)Google Scholar