A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
From MaRDI portal
Publication:2893344
DOI10.1051/ro/2012008zbMath1241.90015OpenAlexW2032157581MaRDI QIDQ2893344
Qingfang Ruan, Kevin Woghiren, Lixin Miao, Qi Ruo
Publication date: 20 June 2012
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222503
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- A genetic algorithm for the vehicle routing problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The Vehicle Routing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Orthogonal Packings in Two Dimensions
- GVR: A New Genetic Representation for the Vehicle Routing Problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Metaheuristics for the vehicle routing problem with loading constraints
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
