Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows
(2017)
Presentation / Conference Contribution
Chen, B., Qu, R., & Ishibuchi, H. (2017). Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows.
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 tig... Read More about Variable-depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows.