期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2021
卷号：99
期号：3
页码：685
出版社：Journal of Theoretical and Applied
摘要：This study focused on solving the Capacitated Vehicle Routing Problem (CVRP). Here, the Traveling Salesman Problem (TSP) is generalized. The two problems are highly related, and solving them is the key to solving many optimization Problems and applications in real life, particularly in the field of transport and distribution. The hybrid Rank-Based Ant System (HAS_rank) Algorithm that is presented in this research, relies on the principle of combining insert and swap algorithms, with the aim of improving tours and reducing transmission and distribution costs. To test the effectiveness of the proposed hybrid algorithm, the results of the study have been evaluated with the results of the standardized CVRP, in addition to comparing the results with those obtained in other studies. The results of the comparisons proved that the performance of the proposed algorithm in terms of finding optimal solutions, is better than those of other algorithms to find optimal solutions.
