Improved exact method for the double TSP with multiple stacks

DOI10.1002/net.20473zbMath1231.90097OpenAlexW1985009750MaRDI QIDQ3113513

No author found.

Publication date: 18 January 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20473

zbMATH Keywords

TSPpackingroutinglongest common subsequence\(k\)-best solution

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

The pickup and delivery problem with time windows, multiple stacks, and handling operations, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, 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, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Uses Software

• Concorde

Cites Work

• New neighborhood structures for the double traveling salesman problem with multiple stacks
• 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
• 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
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem