Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks

DOI10.1016/j.cor.2018.01.005zbMath1391.90530OpenAlexW2782491103MaRDI QIDQ1652571

Sebastián Urrutia, Armando Honorio Pereira

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.005

zbMATH Keywords

traveling salesmanbranch-and-cutloading constraintspickup and deliverymultiple stacks

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (4)

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 ⋮ 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

Cites Work

• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Routing problems with loading constraints
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• The precedence-constrained asymmetric traveling salesman polytope
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Variable Neighborhood Search 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
• 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 branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks