A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

DOI10.1111/itor.12053zbMath1309.90092OpenAlexW2017516328MaRDI QIDQ5246822

Anolan Milanés, Arne Løkketangen, Sebastián Urrutia

Publication date: 22 April 2015

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

Full work available at URL: https://doi.org/10.1111/itor.12053

zbMATH Keywords

heuristicstransportationdynamic programmingtabu search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (5)

What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ 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 ⋮ New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Approximation of the double traveling salesman problem with multiple stacks

Cites Work

• Unnamed Item
• 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
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• An exact method for the double TSP with multiple stacks
• Exact solutions to the double travelling salesman problem with multiple stacks
• Improved exact method for the double TSP with multiple stacks
• Branch-and-Bound Strategies for Dynamic Programming
• Large neighborhood search 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

This page was built for publication: A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks