Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows

Chen, Binhui; Qu, Rong; Ishibuchi, Hisao

Abstract

The Open Periodic Vehicle Routing Problem with Time Windows (OPVRPTW) is a practical transportation routing and scheduling problem arising from real-world scenarios. It shares some common features with some classic VRP variants. The problem has a tightly constrained large-scale solution space and requires well balanced diversification and intensification in search. In Variable Depth Neighbourhood Search, large neighbourhood depth prevents the search from trapping into local optima prematurely, while small depth provides thorough exploitation in local areas. Considering the multi-dimensional solution structure and tight constraints in OPVRPTW, a Variable-Depth Adaptive Large Neighbourhood Search (VD-ALNS) algorithm is proposed in this paper. Contributions of four tailored destroy operators and three repair operators at variable depths are investigated. Comparing to existing methods, VD-ALNS makes a good trade-off between exploration and exploitation, and produces promising results on both small and large size benchmark instances.

Citation

Chen, B., Qu, R., & Ishibuchi, H. (2017). Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows.

• Conference Name: The 19th International Conference on Harbor, Maritime & Multimodal Logistics Modelling and Simulation
• End Date: Sep 20, 2017
• Acceptance Date: Aug 1, 2017
• Publication Date: Sep 18, 2017
• Deposit Date: Dec 13, 2017
• Publicly Available Date: Dec 13, 2017
• Peer Reviewed: Peer Reviewed
• Public URL: https://nottingham-repository.worktribe.com/output/883367
• Publisher URL: http://www.msc-les.org/proceedings/hms/hms2017/hms2017_25.html