An exploration of quantitative models and algorithms for vehicle routing optimization and traveling salesman problems
Year of publication: |
2024
|
---|---|
Authors: | Lähdeaho, Oskari ; Hilmola, Olli-Pekka |
Published in: |
Supply chain analytics. - [Amsterdam] : Elsevier, ISSN 2949-8635, ZDB-ID 3180833-5. - Vol. 5.2024, Art.-No. 100056, p. 1-9
|
Subject: | Branch and Bound | Graphics Processing Unit | Logistics | Parallel Computing | Traveling Salesman Problem | Vehicle Route Optimization | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Logistik | Branch-and-Bound | Algorithmus | Algorithm |
-
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
A branch-and-bound approach to the traveling salesman problem with a drone
Poikonen, Stefan, (2019)
-
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira, (2016)
- More ...
-
Road traffic emissions and emission reduction targets : case of Highway E18 in South-East Finland
Lähdeaho, Oskari, (2021)
-
Lähdeaho, Oskari, (2022)
-
Maritime supply chain sustainability: South-East Finland case study
Lähdeaho, Oskari, (2020)
- More ...