蚁群优化算法
车辆路径问题
布线(电子设计自动化)
计算机科学
启发式
数学优化
蚁群
领域(数学)
电流(流体)
相关性(法律)
最优化问题
国家(计算机科学)
算法
工程类
数学
人工智能
计算机网络
法学
纯数学
电气工程
政治学
作者
Luka Olivari,Goran Đukić
出处
期刊:Tehnički glasnik
[Croatian Dairy Union]
日期:2021-09-14
卷期号:15 (3): 429-434
被引量:1
标识
DOI:10.31803/tg-20210708131104
摘要
Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the present, real-world problems. Heuristic methods are used to solve the problem as Vehicle Routing Problem is NP-hard. Among many different solution methods, the Ant Colony Optimization algorithm is proven to be the efficient solution when dealing with the dynamic version of the problem. Even though this problem is known to the scientific community for decades, the field is extremely active due to technological advancements and the current relevance of the problem. As various sub-types of routing problems and solution methods exist, there is a great number of possible problem-solution combinations and research directions. This paper aims to make a focused review of the current state in the field of Dynamic Vehicle Routing Problems solved by Ant Colony Optimization algorithm, to establish current trends in the field.
科研通智能强力驱动
Strongly Powered by AbleSci AI