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.90022OpenAlexW1982862520MaRDI QIDQ635160
Rita Macedo, Cláudio Alves, François Clautiaux, Saïd Hanafi, 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
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
Layered graph approaches for combinatorial optimization problems, Rich vehicle routing problems: from a taxonomy to a definition, Multi-trip vehicle routing problem with order release time, 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, The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations, An exact framework for the discrete parallel machine scheduling location problem, New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem, A two‐tier urban delivery network with robot‐based deliveries, An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem, Solving vehicle routing problems with intermediate stops using VRPSolver models, An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows, Vehicle routing problems with multiple trips, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration, Column generation based approaches for combined routing and scheduling, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Vehicle routing problems with multiple trips, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, Multi-trip time-dependent vehicle routing problem with time windows, 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
