An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem
Year of publication: |
2023
|
---|---|
Authors: | Minh Anh Nguyen ; Hai Long Luong ; Minh Hoàng Hà ; Ha Bang Ban |
Published in: |
4OR : quarterly journal of the Belgian, French and Italian Operations Research Societies. - Berlin : Springer, ISSN 1614-2411, ZDB-ID 2106212-2. - Vol. 21.2023, 4, p. 609-637
|
Subject: | Benchmark instances | Branch and cut | Parallel drone scheduling | Traveling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Scheduling-Verfahren | Scheduling problem |
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
-
No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
Mucha, Marcin, (2016)
-
The Traveling Salesman Problem with Job-times (TSPJ)
Mosayebi, Mohsen, (2021)
- More ...
-
The parallel drone scheduling traveling salesman problem with collective drones
Minh Anh Nguyen, (2023)
-
The min-cost parallel drone scheduling vehicle routing problem
Minh Anh Nguyen, (2022)
-
An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem
Ha Bang Ban, (2019)
- More ...