Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
Year of publication: |
2020
|
---|---|
Authors: | Cacchiani, Valentina ; Contreras-Bolton, Carlos ; Toth, Paolo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 283.2020, 3 (16.6.), p. 825-843
|
Subject: | Branch-and-Cut algorithm | Genetic algorithm | Mathematical model | Time-dependent Service times | Travelling Salesman | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan, (2021)
-
An enhanced analog nearest neighbor algorithm for route planning after a major disaster
Magnaye, Romulo B., (2020)
-
Optimisation of multiple travelling salesman problem using metaheuristic methods
Dhanalakshmi, R., (2022)
- More ...
-
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
Cacchiani, Valentina, (2023)
-
Non-cyclic train timetabling and comparability graphs
Cacchiani, Valentina, (2010)
-
A railway timetable rescheduling approach for handling large scale disruptions
Veelenturf, Lucas P., (2014)
- More ...