Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking
This paper presents a new generalized vehicle routing problem with a cross-dock. Basic features of the examined problem are the many-to-many relationship between the suppliers and customers, and the use of different vehicle fleets for performing the inbound and outbound routes. An adaptive memory programming method has been developed coupled with a Tabu Search algorithm. For generating new provisional solutions, elite subroutes with varying lengths are identified from the reference solutions and are used as building blocks, while multiple strategies are applied to maintain an effective interplay between diversification and intensification. Various computational experiments are conducted on existing as well as on new data sets with diverse features, regarding the geographic distribution of the nodes and the density of supplier-customer links. Overall, the proposed method performed very well and new best solutions have been found. Lastly, new insights regarding the impact of split options are reported.
KeywordsVehicle routing Distribution Pickup-and-delivery Cross-dock Heuristics
- Enderer F (2014) Integrating dock-door assignment and vehicle routing in cross-docking. MSc Thesis, Concordia UniversityGoogle Scholar
- Grangier P (2016) Résolution de problèmes de tournées avec synchronisation: applications au cas multi-échelons et au cross-docking. Dissertation, École nationale supérieure des Mines de NantesGoogle Scholar
- Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: IEEE proceedings of the international conference on tools with artificial intelligence. pp 160–167Google Scholar
- Nikolopoulou AI, Repoussis PP, Tarantilis CD, Zachariadis EE (2017) Moving products between location pairs: cross-docking versus direct-shipping. Eur J Oper Res 256(3):803–819Google Scholar
- Petersen HL, Ropke S (2011) The pickup and delivery problem with cross-docking opportunity. In: Proceedings of international conference on computational logistics, Hamburg, Germany. pp 101–113Google Scholar