Metaheuristics for vehicle routing problems with three-dimensional loading constraints

DOI10.1016/j.ejor.2009.03.046zbMath1173.90511OpenAlexW1990902176WikidataQ59389674 ScholiaQ59389674MaRDI QIDQ1038331

Guenther Fuellerer, Richard F. Hartl, Karl F. Doerner, Manuel Iori

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.046

zbMATH Keywords

vehicle routingant colony optimizationthree-dimensional packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (47)

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability ⋮ 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 ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks ⋮ Routing problems with loading constraints ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ 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 ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ 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 ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ 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 ⋮ Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model ⋮ Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Metaheuristics ``In the large ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ 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 ⋮ MIP-based approaches for the container loading problem with multi-drop constraints ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions ⋮ A heuristic algorithm for solving triangle packing problem ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Constraints in container loading -- a state-of-the-art review ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints

Uses Software

• Algorithm 864
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Weight distribution considerations in container loading
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• A new rank based version of the ant system. -- A computational study
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• 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
• The Vehicle Routing Problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Orthogonal Packings in Two Dimensions
• 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 Tabu Search Heuristic for the 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
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: Metaheuristics for vehicle routing problems with three-dimensional loading constraints