Efficient algorithms for the double traveling salesman problem with multiple stacks

DOI10.1016/j.cor.2011.06.008zbMath1251.90048OpenAlexW2169677796MaRDI QIDQ1762078

Marc Nunkesser, Alberto Ceselli, Marco Casazza

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.06.008

zbMATH Keywords

heuristicstraveling salesman problemefficient algorithmsLIFO constraints

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 (15)

The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks ⋮ 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 ⋮ 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 ⋮ 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 ⋮ A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Uses Software

• Concorde

Cites Work

• Routing problems with loading constraints
• The vehicle routing problem. Latest advances and new challenges.
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• 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
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• The maximum k-colorable subgraph problem for chordal graphs
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• An improved typology of cutting and packing problems
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• An exact method for the double TSP with multiple stacks
• On the Complexity of the Multiple Stack TSP, kSTSP
• Graph Classes: A Survey
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for the double traveling salesman problem with multiple stacks