A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
From MaRDI portal
Publication:1761159
DOI10.1016/j.cor.2011.11.008zbMath1251.90013OpenAlexW2088314713MaRDI QIDQ1761159
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.008
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (max. 100)
Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-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 ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ Solution validator and visualizer for (combined) vehicle routing and container loading problems ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life 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 ⋮ A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Routing problems with loading constraints
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- An integrated approach to the vehicle routing and container loading problems
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A general heuristic for vehicle routing problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Recent advances in vehicle routing exact algorithms
- The vehicle routing problem. Latest advances and new challenges.
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Exact algorithms for routing problems under vehicle capacity constraints
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Neighborhood structures for the container loading problem: a VNS implementation
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A unified exact method for solving different classes of vehicle routing problems
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- An improved typology of cutting and packing problems
- A heuristic for the three-dimensional strip packing problem
- The Vehicle Routing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- What you should know about the vehicle routing problem
- The Three-Dimensional Bin Packing Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
This page was built for publication: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
