A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

DOI10.1002/net.20192zbMath1146.90012OpenAlexW2749062520MaRDI QIDQ5433189

Gilbert Laporte, Manuel Iori, Silvano Martello, Michel Gendreau

Publication date: 8 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20192

zbMATH Keywords

tabu searchvehicle routingtwo-dimensional packing

Mathematics Subject Classification ID

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

Related Items (61)

Asynchronous optimization of part logistics routing problem ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ New neighborhood structures for the double traveling salesman problem with multiple stacks ⋮ 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 ⋮ Thirty years of heterogeneous vehicle routing ⋮ 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 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 ⋮ Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ 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 ⋮ Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ Variable neighborhood search algorithms for pickup and delivery problems with loading constraints ⋮ A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ The r‐interdiction selective multi‐depot vehicle routing problem ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ A model‐based heuristic to the vehicle routing and loading problem ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model ⋮ Two-dimensional strip packing with unloading constraints ⋮ 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 ⋮ Column generation based primal heuristics for routing and loading problems ⋮ Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks ⋮ The value of integrating loading and routing ⋮ An adapted heuristic approach for a clustered traveling salesman problem with 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 ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Order and static stability into the strip packing problem ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ 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 ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ The double traveling salesman problem with multiple stacks: A variable neighborhood search approach ⋮ A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations ⋮ The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ Two Dimensional Strip Packing with Unloading Constraints ⋮ Two Dimensional Knapsack with Unloading 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

Cites Work

• The Vehicle Routing Problem
• Tabu Search—Part I
• Unnamed Item
• Unnamed Item

This page was built for publication: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints