Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows
From MaRDI portal
Publication:2806989
DOI10.1007/978-3-319-28697-6_67zbMATH Open1342.90027OpenAlexW2469042244MaRDI QIDQ2806989FDOQ2806989
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
Cites Work
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- The truck dispatching problem
- 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
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- 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
Cited In (5)
- A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
- Formulations and exact algorithms for the vehicle routing problem with time windows
This page was built for publication: Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806989)
