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

Chen, Binhui and Qu, Rong and Ishibuchi, Hisao (2017) Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows. In: The 19th International Conference on Harbor, Maritime & Multimodal Logistics Modelling and Simulation, 18-20 September 2017, Barcellona, Spain.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (534kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 13 Dec 2017 10:43
Last Modified: 15 Dec 2017 17:17
URI: http://eprints.nottingham.ac.uk/id/eprint/48713

Actions (Archive Staff Only)

Edit View Edit View