Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Year of publication: |
2009
|
---|---|
Authors: | Campbell, Ann Melissa ; Thomas, Barrett W. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 4, p. 1231-1248
|
Subject: | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics | Theorie | Theory |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Improved genetic algorithms for the travelling salesman problem
Ahmed, Zakir Hussain, (2014)
-
Tabu search for solving the black-and-white travelling salesman problem
Li, Haitao, (2016)
- More ...
-
Data-driven approaches for emissions-minimized paths in urban areas
Ehmke, Jan Fabian, (2016)
-
The same-day delivery problem for online purchases
Voccia, Stacy A., (2019)
-
Does parking matter? : the impact of parking time on last-mile delivery optimization
Reed, Sara, (2024)
- More ...