Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

DOI10.1002/net.20448zbMath1251.90049MaRDI QIDQ4648688

Jean-Yves Potvin, Michel Gendreau, Jean-François Côté

Publication date: 15 November 2012

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

vehicle routing; loading; large neighborhood search; delivery; multiple stacks; pickup

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, Exact algorithms for the double vehicle routing problem with multiple stacks, An adapted heuristic approach for a clustered traveling salesman problem with loading constraints, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, The pickup and delivery traveling salesman problem with handling costs, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The vehicle routing problem with simultaneous pickup and delivery and handling costs, Designing vehicle routes for a mix of different request types, under time windows and loading constraints, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Cites Work

• Optimization by Simulated Annealing
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• A survey of very large-scale neighborhood search techniques
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Record breaking optimization results using the ruin and recreate principle
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• An Exchange Heuristic for Routeing Problems with Time Windows
• Metaheuristics for the vehicle routing problem with loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints