A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Year of publication: |
March-April 2018
|
---|---|
Authors: | Subramanyam, Anirudh ; Gounaris, Chrysanthos E. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 52.2018, 2, p. 386-401
|
Subject: | traveling salesman problem | service consistency | decomposition-based search | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm |
-
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cornu, Marek, (2017)
-
Aguayo, Maichel M., (2018)
-
Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits
Liu, Jiaojiao, (2024)
- More ...
-
Robust multiperiod vehicle routing under customer order uncertainty
Subramanyam, Anirudh, (2021)
-
Subramanyam, Anirudh, (2020)
-
A branch-and-cut framework for the consistent traveling salesman problem
Subramanyam, Anirudh, (2016)
- More ...