Ant colony optimization for the two-dimensional loading vehicle routing problem

DOI10.1016/j.cor.2007.10.021zbMath1157.90335DBLPjournals/cor/FuellererDHI09OpenAlexW1997916674WikidataQ59389697 ScholiaQ59389697MaRDI QIDQ955597

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

Publication date: 20 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.021

zbMATH Keywords

vehicle routingant colony optimizationtwo-dimensional packing

Mathematics Subject Classification ID

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

Related Items (45)

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A branch-and-cut algorithm for the vehicle routing problem with two-dimensional 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 biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ A two-phase scheduling method with the consideration of task clustering for Earth observing satellites ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ Route optimization cold chain logistic distribution using greedy search method ⋮ 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 ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ Routing and scheduling field service operation by P-graph ⋮ Routing problems with loading constraints ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ The pallet-loading vehicle routing problem with stability constraints ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Two-dimensional strip packing with unloading constraints ⋮ 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 ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ The value of integrating loading and routing ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ 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 ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
• Reactive GRASP for the strip-packing problem
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• A lower bound for the non-oriented two-dimensional bin packing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• A new rank based version of the ant system. -- A computational study
• An improved typology of cutting and packing problems
• The Vehicle Routing Problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• An Exact Approach to the Strip-Packing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• 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
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: Ant colony optimization for the two-dimensional loading vehicle routing problem