An exact method for the double TSP with multiple stacks

DOI10.1111/j.1475-3995.2009.00748.xzbMath1220.90109OpenAlexW2008642135MaRDI QIDQ3002549

No author found.

Publication date: 20 May 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/an-exact-method-for-the-double-tsp-with-multiple-stacks(5e451747-047c-4e53-9877-26b80aaa6f7f).html

zbMATH Keywords

packingrouting\(k\)-best solution

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (25)

The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Routing problems with loading constraints ⋮ 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 ⋮ A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks ⋮ New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ An adapted heuristic approach for a clustered traveling salesman problem with loading constraints ⋮ Efficient algorithms for the double traveling salesman problem with multiple stacks ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks ⋮ Improved exact method for the double TSP 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 a traveling salesman problem with pickup and delivery
• The symmetric clustered traveling salesman problem
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions
• 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

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