The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
DOI10.1016/J.EJOR.2021.08.025zbMATH Open1490.90064OpenAlexW3198765738MaRDI QIDQ2077944FDOQ2077944
Authors: Maryam Rajaei, G. Moslehi, Mohammad Reisi-Nafchi
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.025
Recommendations
- The split delivery vehicle routing problem with three-dimensional loading constraints
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A reoptimization algorithm for the shortest path problem with time windows
- 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
- Extreme point-based heuristics for three-dimensional bin packing
- Routing problems with loading constraints
- An integrated approach to the vehicle routing and container loading problems
- Constraints in container loading -- a state-of-the-art review
- Title not available (Why is that?)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- The split delivery vehicle routing problem with three-dimensional loading constraints
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- A model‐based heuristic to the vehicle routing and loading problem
- Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
Cited In (6)
- The transportation problem with packing constraints
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints
- Thirty years of heterogeneous vehicle routing
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Uses Software
This page was built for publication: The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077944)