Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
Publication:1754159
DOI10.1016/J.EJOR.2017.10.029zbMath1403.90162OpenAlexW2672510448MaRDI QIDQ1754159
Sebastian Reil, Andreas Bortfeldt, Lars Mönch
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.029
transportationpackingintegrated routing and packing problemthree dimensional loading constraintsvehicle routing with backhauls and time windows
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (12)
Uses Software
Cites Work
- Rich vehicle routing problems: from a taxonomy to a definition
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- An integrated approach to the vehicle routing and container loading problems
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- The vehicle routing problem with backhauls
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A new branching strategy for time constrained routing problems with application to backhauling
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- A unified solution framework for multi-attribute vehicle routing problems
- Heuristic approaches to vehicle routing with backhauls and time windows
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
- Loading Multiple Pallets
This page was built for publication: Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints