An adapted heuristic approach for a clustered traveling salesman problem with loading constraints

DOI10.1007/S10288-012-0207-YzbMATH Open1253.90043OpenAlexW2093269603MaRDI QIDQ693154FDOQ693154

M. T. Ortuño, Gregorio Tirado, Angel Felipe

Publication date: 7 December 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-012-0207-y

zbMATH Keywords

heuristicsclusterstraveling salesman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Metaheuristics for the vehicle routing problem with loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO 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
• Exact solutions to the double travelling salesman problem with multiple stacks
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints

Cited In (4)

• The vacation planning problem: a multi-level clustering-based metaheuristic approach
• New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
• Exact algorithms for the double vehicle routing problem with multiple stacks
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

   Recommendations

• Routing problems with loading constraints 👍 👎
• Variable neighborhood search algorithms for pickup and delivery problems with loading constraints 👍 👎
• Metaheuristics for the vehicle routing problem with loading constraints 👍 👎
• Review: An annotated bibliography of combined routing and loading problems 👍 👎
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints 👍 👎

This page was built for publication: An adapted heuristic approach for a clustered traveling salesman problem with loading constraints

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