New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
From MaRDI portal
Publication:2968488
DOI10.1111/itor.12261zbMath1358.90122OpenAlexW2523296286MaRDI QIDQ2968488
Afonso H. Sampaio, Sebastián Urrutia
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12261
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (6)
Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ 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 ⋮ Approximation of the double traveling salesman problem with multiple stacks
Cites Work
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- 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
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- The precedence-constrained asymmetric traveling salesman polytope
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The pallet loading problem: a review of solution methods and computational experiments
- 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
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- 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
This page was built for publication: New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks