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

DOI10.1007/s10288-012-0207-yzbMath1253.90043MaRDI QIDQ693154

M. Teresa 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

heuristics; traveling salesman problem; clusters

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

Related Items

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

Cites Work

• 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
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• An exact method for the double TSP with multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• 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
• Metaheuristics for the vehicle routing problem with loading constraints
• 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