A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
From MaRDI portal
Publication:5326770
DOI10.1002/net.21459zbMath1269.90009MaRDI QIDQ5326770
Michel Gendreau, Jean-François Côté, Jean-Yves Potvin, Maria Grazia Speranza, Claudia Archetti
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21459
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
Related Items
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, Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks, Exact algorithms for the double vehicle routing problem with multiple stacks, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Uses Software
Cites Work
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- 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
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- The precedence-constrained asymmetric traveling salesman polytope
- Reachability cuts for the vehicle routing problem with time windows
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- An exact method for the double TSP with multiple stacks
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- Exact solutions to the double travelling salesman problem with multiple stacks
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- On the Complexity of the Multiple Stack TSP, kSTSP
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Metaheuristics for the vehicle routing problem with loading constraints
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
