科研之友
微信
新浪微博
Facebook
分享链接
摘要
To tackle insufficient convergence and exploration capability and time-consuming in solving the Capacitated Vehicle Routing Problem (CVRP), an adaptive large neighborhood search based artificial bee colony algorithm for CVRP was proposed. In this algorithm, five removal operators and two insertion operators were designed. Moreover, a distinct operator-using strategy, a careful scouter strategy and a loose update strategy were incorporated into the proposed method to improve its performance. As a result, the proposed algorithm could search efficiently for acceptable solutions, as it was able to converge to most of the best known solutions on the experimental datasets, and four best known exact solutions were updated. The results showed that the proposed approach had excellent comprehensive performance and all three optimization strategies were effective. ? 2022 CIMS.
- 单位
