The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach

DOI10.1016/J.COR.2013.02.007zbMATH Open1348.90067OpenAlexW2055406384MaRDI QIDQ336445FDOQ336445

Juan-José Salazar-González, María Batista-Galván, Jorge Riera-Ledesma

Publication date: 10 November 2016

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

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

Recommendations

• A 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
• 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
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The bi-objective traveling purchaser problem with deliveries

zbMATH Keywords

branch-and-cutpickup and deliverytraveling purchaser problemlast-in-first-out

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Cites Work

• SCIP: solving constraint integer programs
• The orienteering problem
• The prize collecting traveling salesman problem
• On the symmetric travelling salesman problem I: Inequalities
• Travelling purchaser problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Solving the Orienteering Problem through Branch-and-Cut
• The Covering Salesman Problem
• Odd Minimum Cut-Sets and b-Matchings
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Dynamic tabu search strategies for the traveling purchaser problem
• An exact method for the double TSP with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• Transgenetic algorithm for the traveling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Ant colony optimization for the traveling purchaser problem
• Approximability of the multiple stack TSP
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• On the Complexity of the Multiple Stack TSP, kSTSP
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Sequencing many jobs on a multi-purpose facility
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• A heuristic approach for the travelling purchaser problem
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• Solving the asymmetric traveling purchaser problem

Cited In (6)

• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• The merchant subtour problem
• The traveling purchaser problem with fast service option
• The traveling purchaser problem and its variants
• The bi-objective traveling purchaser problem with deliveries

This page was built for publication: The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach

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