Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Year of publication: |
2021
|
---|---|
Authors: | Dell'Amico, Mauro ; Montemanni, Roberto ; Novellani, Stefano |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 104.2021, p. 1-11
|
Subject: | Branch and bound | Drone-assisted deliveries | Heuristic algorithms | Traveling salesman problem | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound |
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
-
Hernández-Pérez, Hipólito, (2018)
-
A branch-and-bound approach to the traveling salesman problem with a drone
Poikonen, Stefan, (2019)
- More ...
-
Exact models for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
-
Exact models for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2022)
- More ...