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: | CHEN Da, YOU Xiaoming, LIU Sheng |
---|---|
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 |
Similar Items
-
Ant Colony Algorithm Based on Price Fluctuation Strategy and Dynamic Backtracking Mechanism
by: ZHAO Jiabo, YOU Xiaoming, LIU Sheng
Published: (2022-06-01) -
SISTEM PENENTUAN RUTE PENDISTRIBUSIAN PRODUK AIR MINERAL MENGGUNAKAN ALGORITMA ANT COLONY SYSTEM
by: Deny Wiria Nugraha, et al.
Published: (2019-09-01) -
Ant Colony Optimization with Warm-Up
by: Mattia Neroni
Published: (2021-10-01) -
Dynamic Hierarchical Ant Colony Optimization Based on Reward and Punishment Learning Strategy
by: MO Yadong, YOU Xiaoming, LIU Sheng
Published: (2021-09-01) -
Double-Type Ant Colony Algorithm Considering Dynamic Guidance and Neighborhood Interaction
by: PAN Han, YOU Xiaoming, LIU Sheng
Published: (2020-06-01)