ABSTRACT
The one-to-one pickup and delivery problem with time-windows (PDPTW) is one of the most important problems in Operations Research (OR). In this problem a set of goods need to be transported in a given time-window with a fleet of vehicles. The pickup and delivery problem is one of the most challenging and important combinatorial optimisation problems as it has many real-world applications. Selection hyper-heuristics that learn heuristic utility during optimisation have been successfully applied to a variety of different optimisation problems including those in OR. In this paper we investigate the application of a sequence-based selection hyper-heuristic to the one-to-one, static and deterministic variant of the pickup and delivery problem with time-windows and will compare the results against two well known approaches in the Adaptive Large Neighbourhood Search and Grouping Genetic Algorithm.
- Jsprit framework. https://github.com/graphhopper/jsprit. Accessed: 2021-11-25.Google Scholar
- Russell Bent and Pascal Van Hentenryck. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4):875--893, 2006.Google ScholarDigital Library
- Christian Blum, Andrea Roli, and Michael Sampels. Hybrid metaheuristics: an emerging approach to optimization, volume 114. Springer, 2008.Google ScholarCross Ref
- Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and Rong Qu. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12):1695--1724, 2013.Google ScholarCross Ref
- Jan Christiaens and Greet Vanden Berghe. Slack induction by string removals for vehicle routing problems. Transportation Science, 54(2):417--433, 2020.Google ScholarDigital Library
- Timothy Curtois, Dario Landa-Silva, Yi Qu, and Wasakorn Laesanklang. Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO Journal on Transportation and Logistics, 7(2):151--192, 2018.Google ScholarCross Ref
- George B Dantzig and John H Ramser. The truck dispatching problem. Management science, 6(1):80--91, 1959.Google ScholarDigital Library
- Yvan Dumas, Jacques Desrosiers, and Francois Soumis. The pickup and delivery problem with time windows. European journal of operational research, 54(1):7--22, 1991.Google Scholar
- Ahmed Kheiri and Ed Keedwell. A sequence-based selection hyper-heuristic utilising a hidden markov model. In Proceedings of the 2015 annual conference on genetic and evolutionary computation, pages 417--424, 2015.Google ScholarDigital Library
- Haibing Li and Andrew Lim. A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(02): 173--186, 2003.Google ScholarCross Ref
- Quan Lu and Maged Dessouky. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science, 38(4):503--514, 2004.Google ScholarDigital Library
- William P Nanry and J Wesley Barnes. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2):107--121, 2000.Google ScholarCross Ref
- Giselher Pankratz. A grouping genetic algorithm for the pickup and delivery problem with time windows. Or Spectrum, 27(1):21--41, 2005.Google ScholarCross Ref
- Stefan Ropke and Jean-François Cordeau. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(3):267--286, 2009.Google ScholarDigital Library
- Stefan Ropke and David Pisinger. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4):455--472, 2006.Google ScholarDigital Library
- Stefan Ropke, Jean-François Cordeau, and Gilbert Laporte. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks: An International Journal, 49(4):258--272, 2007.Google Scholar
- Carlo S Sartori and Luciana S Buriol. A study on the pickup and delivery problem with time windows: matheuristics and new instances. Computers & Operations Research, 124:105065, 2020.Google ScholarCross Ref
Index Terms
A hyper-heuristic approach for the PDPTW
Recommendations
A Combined Generative and Selective Hyper-heuristic for the Vehicle Routing Problem
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Hyper-heuristic methods for solving vehicle routing problems (VRP) have proved promising on a range of data. The vast majority of approaches apply selective hyper-heuristic methods that iteratively choose appropriate heuristics from a fixed set of pre-...
A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem
The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic ...
An empirical study into the structure of heuristic combinations in an evolutionary algorithm hyper-heuristic for the examination timetabling problem
SAICSIT '10: Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information TechnologistsA hyper-heuristic for the examination timetabling problem searches a space of constructive heuristic combinations instead of a space of examination timetables. The most optimal heuristic combination found by the search is used to construct the ...
Comments