An effective tabu search approach with improved loading algorithms for the 3L-CVRP
From MaRDI portal
Publication:337416
DOI10.1016/J.COR.2013.10.017zbMath1348.90135OpenAlexW2080943144MaRDI QIDQ337416
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.2013.10.017
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ A MIP-based slicing heuristic for three-dimensional bin packing ⋮ The split delivery vehicle routing problem with time windows and three-dimensional 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 ⋮ Solution validator and visualizer for (combined) vehicle routing and container loading problems ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ 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 ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- 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)
- An integrated approach to the vehicle routing and container loading problems
- The vehicle routing problem. Latest advances and new challenges.
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- New bounds for multidimensional packing
- 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
- New lower bounds for the three-dimensional finite bin packing problem
- Heuristics for the container loading problem
- Heuristic algorithms for the three-dimensional bin packing 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
- A variable neighbourhood search algorithm for the open 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
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A simple and efficient tabu search heuristic for solving the open vehicle routing 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
- New classes of fast lower bounds for bin packing problems
This page was built for publication: An effective tabu search approach with improved loading algorithms for the 3L-CVRP
