Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
From MaRDI portal
Publication:2958357
DOI10.1007/978-3-319-48749-6_51zbMath1486.90035OpenAlexW2544511891MaRDI QIDQ2958357
Xiaoli Zeng, Liang Song, Xiaohan He, Hejiao Huang, Hongwei David Du
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_51
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The vehicle routing problem with flexible time windows and traveling times
- Real-time vehicle rerouting problems with time windows
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Greedy randomized adaptive search procedures
- A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline
- Partially dynamic vehicle routing—models and algorithms