Service composition optimization approach based on affection ant colony algorithm

2013 ◽  
Vol 32 (12) ◽  
pp. 3347-3352 ◽  
Author(s):  
Hong-jiang MA ◽  
Xiang-bing ZHOU
2012 ◽  
Vol 201-202 ◽  
pp. 943-946
Author(s):  
Jiao Yin ◽  
Wei Xiang ◽  
Sai Feng Chen

Surgery scheduling under upstream and downstream resource constraints was described as a three-stage multi-resource constrained flexible flow-shop scheduling problem in this study and an optimization approach based on ant colony algorithm was proposed for obtaining an optimal surgery schedule with respect to minimizing the makespan. A resource selection rule and strategy of overtime judging and adjusting was designed to allocate the resources reasonably and to make the scheduling results closer to reality. Compared to actual scheduling, the computerized result shows that the improved ant colony algorithm proposed in this paper achieved good results in shortening total time and allocating resources for surgery scheduling.


2014 ◽  
Vol 513-517 ◽  
pp. 3950-3953
Author(s):  
Yan Ping Du ◽  
Zhen Qing Gao ◽  
Xiao Hui Wang

On the background of railway freight transportation under emergency situations, the optimal evacuation function to minimize the total evacuation time and evacuation distance is put forward; in consideration of the dynamic and complex natures of evacuation network, searching evacuation route algorithm based on MMAS (Max-min ant colony algorithm) was proposed which can meet the dynamic change of evacuation network.


2019 ◽  
Vol 102 (1-4) ◽  
pp. 355-368 ◽  
Author(s):  
Yefeng Yang ◽  
Bo Yang ◽  
Shilong Wang ◽  
Feng Liu ◽  
Yankai Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document