Pickup and delivery problem arises in real-world logistics, especially with the growth of the e-commerce market. The logistics providers create jobs for customers that are paired together, and a pair must be serviced by the same vehicle. An effective and fast hybrid metaheuristic is proposed for solving this problem with the focus of optimizing the number of routes, and travel distances with consideration of fast computation times. This work finds a large number of new best-known solutions on a well-known benchmark dataset.
Curtois, T., Landa-Silva, D., Qu, Y., & Laesanklang, W. (2018). 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.