THE ANT COLONY OPTIMIZATION ALGORITHM APPLIED IN TRANSPORT LOGISTICS

被引：0

作者：

Ostrowski, Krzysztof ^{[1
,2
]}

Starzec, Grazyna ^{[2
,3
]}

Starzec, Mateusz ^{[2
]}

机构：

[1] Bialystok Tech Univ, Fac Comp Sci, Ul Wiejska 45A, PL-15351 Bialystok, Poland

[2] Sentio Sp Zoo, Ul Warszawska 6-32, PL-15063 Bialystok, Poland

[3] AGH Univ Sci & Technol, Fac Comp Sci, Al Adama Mickiewicza 30, PL-30059 Krakow, Poland

来源：

COMPUTER SCIENCE-AGH | 2024年 / 25卷 / 03期

关键词：

ant colony optimization; ACO; metaheuristic; routing problems; transport logistics; delivery; VEHICLE-ROUTING PROBLEM; TIME WINDOWS; EVOLUTIONARY ALGORITHM; TABU SEARCH; HEURISTICS; NUMBER;

D O I：

10.7494/csci.2024.25.3.6360

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Vehicle Routing Problem belongs to graph optimization and its goal is to find shortest routes visiting a given set of customers with additional constraints present. The article presents the ant colony optimization metaheuristic which solves vehicle routing problems and its real-life application in transport logistics (finding routes for delivery companies). The metaheuristic generated high- quality solutions (superior to compared methods). Our tool is flexible and enables us to solve various variants of routing problems so it is well suited to specific needs of transportation companies.

引用

页码：1 / 20

页数：20

共 31 条

[1]

Álvarez Aldair, 2016, Gest. Prod., V23, P279, DOI 10.1590/0104-530x2359-15

[2]

[Anonymous], VRPTW instances

[3]

[Anonymous], [13] Oracle, Java, 2018 (accessed June 7, 2018). [Online]. Available: https://java.com/en/

[4]

Araque J. R., 1994, Annals of Operations Research, V50, P37, DOI 10.1007/BF02085634