Multiprocessor Scheduling Problem Based on Ant Colony Optimization Algorithm

Abstract:

Multiprocessor Scheduling is a problem of discrete optimization. The strong optimization capacity of Ant Colony Algorithm (ACA) on solving the discrete optimization suggests the feasibility to solve the multiprocessor scheduling problem using the ACA algorithm. Contrary to the shortcomings of traditional ant colony algorithm, this is easy to fall into the local convergence, In order to improve the calculation accuracy. combined of multiprocessor scheduling problem, propose a more efficient ant colony optimization algorithm and present a new state transition rule, at the same time use dynamically update the strategy of ant pheromones and the optimal parameter selection. it can find a better scheduling strategy in a short time, and it has excellent global optimization properties, The simulation results show that the credibility and the validity of the improved ant colony optimization algorithm for multiprocessor scheduling problem.

• Periodical: Advanced Materials Research (Volumes 532-533)
• Pages: 1235-1238
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.532-533.1235
• Online since: June 2012
• Authors: Yan Li
• Keywords: Multiprocessor Scheduling, Optimization, Simulation Component

References

[1] M. Dorigo, V. Maniezzo, Colorni Alberto, The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 1996, pp.1-13.

DOI: 10.1109/3477.484436

[2] M. Dorigo, Gambardella L M, Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1997, pp.53-66.

DOI: 10.1109/4235.585892

[3] Colornia, M. Dorigo, V. Maniezzo, Ant Colony system for job-shop scheduling [J]. Belgian J of Operations Research Statistics and Computer Science, 1994, pp.39-53.

[4] V. Maniezzo, A. Carbonaro, An ant Heuristic for the frequency assignnment problem, Future Generation Computer Systems, 2000, pp.927-935.

DOI: 10.1016/s0167-739x(00)00046-7

[5] Wu Qi di, Wang Lei, Intelligent Ant Colony Algorithm and Its Application [M]. Shanghai: Shanghai Science and Technology Education Press, (2004).

[6] Wang Xiaorong, Wu Tiejun, Flow shop scheduling problems ant colony optimization method [J]. Systems Engineering Theory and Practice, vol. 5, 2003, p.65–71.

[7] T. Stutzle, Parallelization strategies for ant colony optimization, Lecture Notes in Computer Science 1498(1998), p.722–731.

[8] Gao Shang, Zhong Juan, Mo Shujun, Multiprocessor scheduling problem in the ant colony algorithm [J]. Micro Computer Applications, vol. 19, 2003, p.9–16.

[9] Zhang Yong, Zhang Xihuang, Improved ant colony algorithm for multiprocessor task scheduling [J]. Computer Engineering and Applications, vol. 43, 2007, p.74–76.