A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
From MaRDI portal
Publication:1761144
DOI10.1016/j.cor.2011.11.001zbMath1251.90346MaRDI QIDQ1761144
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.001
90B40: Search theory
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
Related Items
Heuristic solution approaches for the cumulative capacitated vehicle routing problem, A fast implementation for the 2D/3D box placement problem, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, Integrated distribution and loading planning via a compact metaheuristic algorithm, 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 tabu search algorithm for the multi-period inspector scheduling problem, Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem, A simulated annealing algorithm for the capacitated vehicle routing problem with 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, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, Vehicle routing problems with loading constraints: state-of-the-art and future directions, A hybrid algorithm for time-dependent vehicle routing problem with time windows, The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale, Effective loading in combined vehicle routing and container loading problems, Multi-objective vehicle routing and loading with time window constraints: a real-life application, The split delivery vehicle routing problem with three-dimensional loading constraints, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Network scheduling problem with cross-docking and loading constraints, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid placement strategy for the three-dimensional strip packing problem
- An integrated approach to the vehicle routing and container loading problems
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- An optimal algorithm for rectangle placement
- An exact algorithm for the pallet loading problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- 3-D container packing heuristics
- A heuristic for the three-dimensional strip packing problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- A Maximal-Space Algorithm for the Container Loading Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- The Three-Dimensional Bin Packing Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A hybrid genetic algorithm for the container loading problem