Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
From MaRDI portal
Publication:635160
DOI10.1016/j.ejor.2011.04.037zbMath1219.90022MaRDI QIDQ635160
Saïd Hanafi, Cláudio Alves, François Clautiaux, Rita Macedo, José M. Valério de Carvalho
Publication date: 19 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.037
90C10: Integer programming
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
Related Items
Vehicle routing problems with multiple trips, Rich vehicle routing problems: from a taxonomy to a definition, Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows, Using the primal-dual interior point algorithm within the branch-price-and-cut method, A tabu search algorithm for the multi-period inspector scheduling problem, Skewed general variable neighborhood search for the location routing scheduling problem, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration, Solving network design problems via iterative aggregation
Uses Software
Cites Work
- Unnamed Item
- Adaptive memory programming for the vehicle routing problem with multiple trips
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- A GA based heuristic for the vehicle routing problem with multiple trips
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The multi-trip vehicle routing problem
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- Vehicle Routeing with Multiple Use of Vehicles
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints