scholarly journals Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm

2021 ◽  
Vol 12 ◽  
pp. 100207
Author(s):  
Liuyi Wang ◽  
Zongtao He ◽  
Chengju Liu ◽  
Qijun Chen
Keyword(s):  
Assignment Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Improved Ant Colony Algorithm

Assignment Problem Based on Improved Ant Colony Algorithm

2011 ◽  
Vol 55-57 ◽  
pp. 356-360
Author(s):  
Zhi’e Gao ◽  
Gong Jing Zhang
Keyword(s):  
Combinatorial Optimization ◽  
Assignment Problem ◽  
Ant Colony Algorithm ◽  
Convergence Speed ◽  
Ant Colony ◽  
Improvement Strategies ◽  
Improved Ant Colony Algorithm

Assignment problem is a combinatorial optimization problem.In this paper,a improved ant colony algorithm is proposed to solve the assignment problem.According to the rule of state-shift and strategty of updating pheromone, parameters of the ant colony Algorithm are optimized and changed,the best solution can be found rapidly,the simulative results show that the improvement strategies can well improve convergence speed and quality.

Sign in / Sign up

Export Citation Format

Share Document