解多处理机的摸石头过河算法-atlantispress.pdfVIP

Advances in Computer Science Research (ACSR), volume 61 7th International Conference on Education, Management, Computer and Society (EMCS 2017) Multiprocessor Scheduling Problem by Wading across Stream Algorithm Shang Gao1, a* and Yong Liu2, b 1 School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China; 2Artificial Intelligence of Key Laboratory of Sichuan Province, Zigong 643000, China. aGao_shang@ bsusergzn@163.com Abstract. The Wading across Stream Algorithm (WSA) act a solution as a start point, then search several solutions randomly near the start point, and find the best solution of these solutions. This best solution is to take as next start point, and then search several solutions randomly near this start point, and so on. For solving the Multiprocessor Scheduling problem, two methods to selected the initial solution as start solution were given. In order to search neighborhood trial solution, four strategies are put forward.. It is proved that Wading across Stream Algorithm is a simple and effective algorithm. Keywords: Random optimization algorithm; Multiprocessor Scheduling problem; wading across stream algorithm 解多处理机的摸石头过河算法 1 刘勇2 高尚 ， (1.江苏科技大学计算机科学与工程学院，江苏 镇江 212003；2.人工智能四川省高校重点实验室, 自贡 643000) 摘要：依据“摸石头过河”的思想，提出一种快速、高效的随机优化算法。摸石头过河算法是以一个解为起点，向该起 点附近邻域随机搜索若干个解，找出这些解中的最好的一个解，以此解为下次迭代的结果，然后以此点为起点，再向附近邻 域随机搜索若干个解，以此类推。解多处理机题时，采用了2 种选取初始解方法;找邻域解时,提出4 种策略，测试表明,摸 石头过河算法是有效 关键词：随机优化算法；多处理机问题；摸石头过河算法 中图分类号： TP391 文献标志码： A 引言 所谓多处理机调