Dual Ant Colony Algorithm Based on Backtracking Migration and Matching Learning
In order to solve the problems of slow convergence speed and easy to fall into local optimum of tradi-tional ant colony algorithm in solving traveling salesman problem (TSP), the dual ant colony algorithm based on backtracking migration and matching learning (BMACS) is proposed. Firstly, the populat...
Main Author: | |
---|---|
Format: | Article |
Language: | zho |
Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-12-01
|
Series: | Jisuanji kexue yu tansuo |
Subjects: | |
Online Access: | http://fcst.ceaj.org/fileup/1673-9418/PDF/2104006.pdf |