Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows
From MaRDI portal
Publication:2806989
DOI10.1007/978-3-319-28697-6_67zbMath1342.90027MaRDI QIDQ2806989
Matteo Salani, Maria Battarra, Luca Maria Gambardella
Publication date: 19 May 2016
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_67
90B06: Transportation, logistics and supply chain management
Cites Work
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The Truck Dispatching Problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- A unified tabu search algorithm for vehicle routing problems with soft time windows