An effective tabu search approach with improved loading algorithms for the 3L-CVRP

DOI10.1016/J.COR.2013.10.017MaRDI QIDQ337416zbMATH OpenOpenAlexFDO

Authors Yi Tao, Fan Wang

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

zbMATH Keywords

tabu searchcapacitated vehicle routingimproved least waste heuristicthree-dimensional loading

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• 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
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints

Cites work

• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
• A least wasted first heuristic algorithm for the rectangular packing problem
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• A variable neighbourhood search algorithm for the open vehicle routing problem
• An Algorithm for Two-Dimensional Cutting Problems
• An integrated approach to the vehicle routing and container loading problems
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Extreme point-based heuristics for three-dimensional bin packing
• Guided local search for the three-dimensional bin-packing problem
• Handbooks in operations Research \& management science: Transportation
• Heuristic algorithms for the three-dimensional bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Heuristics for the container loading problem
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
• Metaheuristics for the vehicle routing problem with loading constraints
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• New bounds for multidimensional packing
• New classes of fast lower bounds for bin packing problems
• New heuristics for the vehicle routing problem
• New lower bounds for the three-dimensional finite bin packing problem
• Orthogonal Packings in Two Dimensions
• Routing problems with loading constraints
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• The Three-Dimensional Bin Packing Problem
• The vehicle routing problem. Latest advances and new challenges.

Cited in

(20)

• Solution validator and visualizer for (combined) vehicle routing and container loading problems
• 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 time windows and three-dimensional loading constraints
• Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
• Model and algorithm for multi-objective joint optimization of three-dimensional loading and CVRP
• The static stability of support factor‐based rectangular packings: an assessment by regression analysis
• Effective loading in combined vehicle routing and container loading problems
• A MIP-based slicing heuristic for three-dimensional bin packing
• The split delivery vehicle routing problem with three-dimensional loading constraints
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
• Multi-objective vehicle routing and loading with time window constraints: a real-life application
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Describes a project that uses

Uses Software

• VRP

This page was built for publication: An effective tabu search approach with improved loading algorithms for the 3L-CVRP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337416)