Solving the clustered traveling salesman problem with -relaxed priority rule
Year of publication: |
2022
|
---|---|
Authors: | Minh Hoàng Hà ; Hoa Nguyen Phuong ; Huyen Tran Ngoc Nhat ; Langevin, André ; Trépanier, Martin |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 2, p. 837-853
|
Subject: | -relaxed priority rule | clustered traveling salesman problem | iterated local search | mixed integer programming | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Regionales Cluster | Regional cluster |
-
Sampaio, Afonso H., (2017)
-
The capacitated family traveling salesperson problem
Domínguez-Casasola, Saúl, (2024)
-
A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Martínez, Manuel A. Alba, (2013)
- More ...
-
Solving the clustered traveling salesman problem with ‐relaxed priority rule
Minh Hoàng, (2020)
-
Hà, Minh Hoàng, (2013)
-
Hà, Minh Hoàng, (2013)
- More ...