Iterated maximum large neighborhood search for the Traveling Salesman problem with Time Windows and its Time-Dependent version
Cédric Pralet
Year of publication: |
2023
|
---|---|
Authors: | Pralet, Cédric |
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. 150.2023, p. 1-20
|
Subject: | Traveling Salesman Problem with Time Windows | Time-dependent transitions | Large Neighborhood Search | Makespan minimization | Solution feasibility | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Heuristik | Heuristics |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Scheduled penalty variable neighborhood search
Thomas, Barrett W., (2014)
-
Branch-and-refine for solving time-expanded MILP formulations
Gnegel, Fabian, (2023)
-
Improved genetic algorithms for the travelling salesman problem
Ahmed, Zakir Hussain, (2014)
- More ...
Similar items by person