Efficient algorithms for the double traveling salesman problem with multiple stacks

DOI10.1016/J.COR.2011.06.008zbMATH Open1251.90048OpenAlexW2169677796MaRDI QIDQ1762078FDOQ1762078

Authors: Marco Casazza, Alberto Ceselli, Marc Nunkesser 

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

Recommendations

• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Exact solutions to the double travelling salesman problem with multiple stacks
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
• A branch-and-bound algorithm for the double travelling salesman problem with two stacks

zbMATH Keywords

heuristicstraveling salesman problemefficient algorithmsLIFO constraints

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• An improved typology of cutting and packing problems
• Graph Classes: A Survey
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Routing problems with loading constraints
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• The maximum k-colorable subgraph problem for chordal graphs
• Title not available (Why is that?)
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• An exact method for the double TSP with multiple stacks
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• On the Complexity of the Multiple Stack TSP, kSTSP
• A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Cited In (17)

• Approximation of the double traveling salesman problem with multiple stacks
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
• What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• Exact algorithms for the double vehicle routing 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
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• A set covering approach for the double traveling salesman problem with multiple stacks
• A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
• Efficient algorithms for the double traveling salesman problem with multiple stacks
• A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Uses Software

• Concorde

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

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