Solving the clustered traveling salesman problem with ‐relaxed priority rule

DOI10.1111/itor.12797arXiv1810.03981OpenAlexW3016159714MaRDI QIDQ6070874

Minh Hoàng Hà, André Langevin, Unnamed Author, Martin Trépanier, Unnamed Author

Publication date: 24 November 2023

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

Full work available at URL: https://arxiv.org/abs/1810.03981

zbMATH Keywords

mixed integer programmingiterated local searchclustered traveling salesman problem\(d\)-relaxed priority rule

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule

Cites Work

• Unnamed Item
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• The hierarchical traveling salesman problem
• Variable neighborhood search
• Advances in computational and stochastic optimization, logic programming, and heuristic search. Interfaces in computer science and operations research. 6th conference of the Computer Science Technical Section of INFORMS, January 7--9, 1998, Carmel, CA, USA
• Metaheuristics for the tabu clustered traveling salesman problem
• Greedy randomized adaptive search procedures
• A simple and effective metaheuristic for the minimum latency problem
• Emergency relief routing models for injured victims considering equity and priority
• The traveling salesman problem and its variations.
• Vehicle Routing
• Priority Assignment in Emergency Response
• TSPLIB—A Traveling Salesman Problem Library
• Handbook of metaheuristics

This page was built for publication: Solving the clustered traveling salesman problem with ‐relaxed priority rule