An exact method for the double TSP with multiple stacks
From MaRDI portal
Publication:3002549
DOI10.1111/j.1475-3995.2009.00748.xzbMath1220.90109MaRDI 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
90C27: Combinatorial optimization
Related Items
A dynamic programming based local search approach for the double traveling salesman 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, 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, 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, Exact algorithms for the double vehicle routing problem with multiple stacks, Routing problems with loading constraints, Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, An adapted heuristic approach for a clustered traveling salesman problem with loading constraints, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks, Efficient algorithms for the double traveling salesman problem with multiple stacks, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Approximation of the double traveling salesman problem with multiple stacks, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Improved exact method for the double TSP 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
