收录:
摘要:
For better solving vehicle routing problem (VRP), the solution processes of three algorithms including ant colony, particle swarm optimization and simulated annealing are introduced and compared in performance. Three customer sizes of Solomon data set are selected to evaluate the solution performance of these algorithms. Results show that particle swarm optimization algorithm has unsatisfactory effects in capacitated vehicle routing problem (CVRP) of all scales. Simulated annealing algorithm could obtain the optimal solution in small and medium-size. Ant colony algorithm has the highest comprehensive evaluation for solving all sizes CVRP. The research results could provide reference value for selecting algorithms to solve VRP problem with volume constraints. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
关键词:
通讯作者信息:
电子邮件地址:
来源 :
ISSN: 1876-1100
年份: 2023
卷: 1047 LNEE
页码: 909-915
语种: 英文
归属院系: