Improved exact method for the double TSP with multiple stacks

DOI10.1002/NET.20473MaRDI QIDQ3113513zbMATH OpenOpenAlexFDO

Authors

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

\(k\)-best solutionlongest common subsequencepackingroutingTSP

Mathematics Subject Classification ID

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

Recommendations

• An exact method for the double TSP with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Exact algorithms for the double vehicle routing problem with multiple stacks
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Cites work

• 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
• An exact method for the double TSP with multiple stacks
• 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

Cited in

(9)

• 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
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• A set covering approach for the double traveling salesman problem with multiple stacks
• An exact method for the double TSP with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• Exact algorithms for the double vehicle routing problem with multiple stacks
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Improved exact method for the double TSP with multiple stacks

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