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...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Chinês |
| Опубликовано: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2022-12-01
|
| Серии: | Jisuanji kexue yu tansuo |
| Предметы: | |
| Online-ссылка: | http://fcst.ceaj.org/fileup/1673-9418/PDF/2104006.pdf |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|