An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
From MaRDI portal
Publication:2862156
DOI10.1111/j.1475-3995.2012.00872.xzbMath1276.90012WikidataQ57719435 ScholiaQ57719435MaRDI QIDQ2862156
Reinaldo Morabito, Leonardo Junqueira, Maria Antónia Carravilla, José Fernando Oliveira
Publication date: 14 November 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2012.00872.x
Related Items
A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale, The pickup and delivery problem with time windows, multiple stacks, and handling operations, The split delivery vehicle routing problem with three-dimensional loading constraints, Network scheduling problem with cross-docking and loading constraints, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
Uses Software
Cites Work
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- An integrated approach to the vehicle routing and container loading problems
- The vehicle routing problem. Latest advances and new challenges.
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A new formulation for the traveling deliveryman problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Allowing for weight considerations in container loading
- A classification of formulations for the (time-dependent) traveling salesman problem
- 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
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- Constraints in container loading -- a state-of-the-art review
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Three-dimensional packing of items with limited load bearing strength
- An improved typology of cutting and packing problems
- The Vehicle Routing Problem
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- Container loading with multi-drop constraints
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An Algorithm for Two-Dimensional Cutting Problems
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- An AND/OR-graph approach to the container loading problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem
