Variable neighbourhood search for close–open vehicle routing problem with time windows
From MaRDI portal
Publication:5382674
DOI10.1093/IMAMAN/DPT024zbMATH Open1433.90025OpenAlexW1981829137MaRDI QIDQ5382674
Airam Expósito, J. Brito, José A. Moreno
Publication date: 18 June 2019
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dpt024
vehicle routing problem with time windowsvariable neighbourhood searchclose-open vehicle routing problem
Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities ⋮ Unnamed Item ⋮ A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
Recommendations
- Unnamed Item 👍 👎
- Unnamed Item 👍 👎
- Variable neighborhood descent for solving the vehicle routing problem with time windows 👍 👎
- Variable neighborhood search for vehicle routing problem with multiple time windows 👍 👎
- A variable neighbourhood search algorithm for the open vehicle routing problem 👍 👎
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities 👍 👎
- A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows 👍 👎
This page was built for publication: Variable neighbourhood search for close–open vehicle routing problem with time windows