New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

DOI10.1111/ITOR.12261MaRDI QIDQ2968488zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

integer programmingtransportationvalid inequalitiestraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• Formulations and algorithms 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
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Cites work

• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A branch-and-cut algorithm 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
• An exact method for the double TSP with multiple stacks
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• 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
• Optimal routing of multiple-load AGV subject to LIFO loading constraints
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• 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
• The pallet loading problem: a review of solution methods and computational experiments
• The precedence-constrained asymmetric traveling salesman polytope
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm

Cited in

(14)

• 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
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
• Approximation of the double traveling salesman problem with multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• 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 branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints

This page was built for publication: New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968488)