人工蜂群算法
水准点(测量)
计算机科学
蜜蜂算法
数学优化
序列(生物学)
车辆路径问题
人工智能
算法
元启发式
布线(电子设计自动化)
数学
生物
遗传学
计算机网络
大地测量学
地理
作者
Yenny Anggreini Sarumaha,Dede Ridho Firdaus,Irwan Moridu
标识
DOI:10.61487/jiste.v1i1.9
摘要
The problem of vehicle routing with capacity is a combinatorial optimization problem that is included in the NP-Hard category. In this article, we suggest an artificial bee colony algorithm, which is a technique inspired by the clever behavior of bees in searching for food sources. To achieve the best outcomes, the artificial bee colony algorithm will be developed in conjunction with other algorithms. To determine how well the artificial bee colony method handles the issue of optimizing vehicle routes with capacity, eight distinct benchmark problems will be completed and then contrasted with other algorithms. The output of this research is a matrix showing the sequence of vehicle routes formed.
科研通智能强力驱动
Strongly Powered by AbleSci AI