A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
From MaRDI portal
Publication:336326
DOI10.1016/j.cor.2011.11.013zbMath1348.90120OpenAlexW2007498220MaRDI QIDQ336326
Lixin Miao, Qingfang Ruan, Zhengqian Zhang, Hai-Tao Shen
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.013
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (17)
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 ⋮ 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 hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ 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 ⋮ Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal ⋮ 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
Uses Software
Cites Work
- Routing problems with loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
- An integrated approach to the vehicle routing and container loading 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
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Exact algorithms for routing problems under vehicle capacity constraints
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- A tabu search algorithm for weakly heterogeneous container loading problems
- Three-dimensional container loading models with cargo stability and load bearing constraints
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Greedy randomized adaptive search procedures
- 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 unified exact method for solving different classes of vehicle routing problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The Truck Dispatching Problem
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- An exact method for the double TSP with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- A Parallel Genetic Algorithm for Solving 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
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
This page was built for publication: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
