A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Year of publication: |
2015
|
---|---|
Authors: | Urrutia, Sebastián ; Milanés, Anolan ; Lokketangen, Arne |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 22.2015, 1, p. 61-75
|
Subject: | heuristics | dynamic programming | transportation | tabu search | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Dynamic programming | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
A large neighborhood search for the vehicle routing problem with multiple time windows
Schaap, Hendrik, (2022)
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
On parallel local search for permutations
Riise, Atle, (2015)
- More ...
-
Tomacheski, Clynton, (2024)
-
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
Haugen, Kjetil K., (2001)
-
Rich models in discrete optimization: Formulation and resolution (ECCO XVI)
Hasle, Geir, (2006)
- More ...