A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

DOI10.1002/net.20312zbMath1206.90137OpenAlexW4247344008MaRDI QIDQ3057131

Gilbert Laporte, Jean-François Cordeau, Manuel Iori, Juan-José Salazar-González

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problembranch-and-cutpickup and deliveryLIFO

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

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, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, The multiple vehicle pickup and delivery problem with LIFO 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, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Exact algorithms for the double vehicle routing problem with multiple stacks, 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, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Routing problems with loading constraints, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A concise guide to existing and emerging vehicle routing problem variants, A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs, The double traveling salesman problem with partial last‐in‐first‐out loading constraints, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks, A branch-and-cut algorithm for factory crane scheduling problem, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Heuristic and exact algorithms for the multi-pile vehicle routing problem, An exact method for the double TSP with multiple stacks, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system, The pickup and delivery traveling salesman problem with handling costs, An adapted heuristic approach for a clustered traveling salesman problem with loading constraints, The traveling salesman problem with draft limits, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, Models and Algorithms for Intermodal Transportation and Equipment Selection, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Exact solutions for the collaborative pickup and delivery problem, Exact solutions to the double travelling salesman problem with multiple stacks, 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, Improved exact method for the double TSP with multiple stacks, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

Cites Work

• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• An algorithm for the traveling salesman problem with pickup and delivery customers
• A result on projection for the vehicle routing problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• The precedence-constrained asymmetric traveling salesman polytope
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Projection results for vehicle routing
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• The General Pickup and Delivery Problem
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints