arrow
返回

Adaptive gradient descent enabled ant colony optimization for routing problems

delete2022-04-01
delete28
PRE
AI
Y
Yi Zhou
李
李伟东 (Weidong Li) *
X
Xiaomao Wang
Y
Yimin Qiu
沈卫明 封面图
沈卫明 (Weiming Shen)
DOI:10.1016/j.swevo.2022.101046delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The design of Ant Colony Optimization (ACO) has been inspired by the foraging behavior of ant colonies. ACO is one of the most widely used metaheuristic algorithms applicable to various optimization problems. Nevertheless, the deficiency of ACO is early maturity and slow convergence, usually leading to dissatisfactory performance. In this research, a new type of ACO is proposed with innovative adaptive learning mechanism is devised (the algorithm is called ADACO). In the paper, first, the ACO algorithm for Traveling Salesman Problem (TSP) is modeled in the framework of reinforcement learning (RL) and learns a best policy by stochastic gradient descent (SGD). Then, an adaptive gradient descent strategy, which can exploit the update history of per-dimensional pheromones to achieve intelligent convergence, is integrated into the ACO algorithm as ADACO. A parallel computation process is implemented in the process to expedite computational efficiency. Finally, through case studies in TSP and Capacitated Vehicle Routing Problem (CVRP), ADACO is validated. ADACO is trialed on various sizes of TSP and CVRP instances and compared with other state-of-the-art algorithms. Results show that ADACO is competitive in terms of accuracy (better in most cases), stability (statistically significant) and adaptability (support various types of problems). The results also elucidate that the algorithm maintains good computational efficiency owing to its parallel implementation. It can be concluded that ADACO is effectively applicable to routing problems with good performance.
Keyword:
Ant colony optimization
Stochastic gradient descent
Adaptive learning
Traveling salesman problem

期刊

Swarm and Evolutionary Computation 封面图
Swarm and Evolutionary Computation
IF:
8.5
论文数:
2.2K
被引数:
1.0W

机构

暂无机构信息
引用论文

引用论文

Ant colony optimization with dynamic parameter adaptation based on interval type-2 fuzzy logic systems
err2017-04-01
err117
PREAI
errOlivas, Frumen; Valdez, Fevrier; Castillo, Oscar; Gonzalez, Claudia I.; Martinez, Gabriela; Melin, Patricia
err分享
err收藏
New benchmark instances for the Capacitated Vehicle Routing Problem
err2017-03-01
err281
PREAI
errUchoa, Eduardo; Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Vidal, Thibaut; Subramanian, Anand
err分享
err收藏
High-resolution infrared spectroscopy of hydrogen impurities in strontium titanate
err1987-04-01
err0
PREAI
errD. Houde; Y. Lépine; C. Pépin; S. Jandl; J. L. Brebner
err分享
err收藏
Discovering communities from disjoint complex networks using Multi-Layer Ant Colony Optimization
err2021-02-01
err23
PREAI
errImtiaz, Zar Bakht; Manzoor, Awais; ul Islam, Saif; Judge, Malik Ali; Choo, Kim-Kwang Raymond; Rodrigues, Joel J. P. C.
err分享
err收藏
学者 查看更多内容