New simulation-calculation method of solving optimized scheduling problem

doi:10.3778/j.issn.1002-8331.2009.31.012

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (31): 37-39.DOI: 10.3778/j.issn.1002-8331.2009.31.012

• 研究、探讨 • Previous Articles Next Articles

New simulation-calculation method of solving optimized scheduling problem

WANG Jing-lian¹，LIU Hong²，LIU Xin-hua¹，LI Shao-hui²

1.Teaching Department of Modern Education Technology，Ludong University，Yantai，Shandong 264025，China
2.School of Information Management，Shandong Normal University，Jinan 250014，China

Received:2008-11-12 Revised:2009-05-14 Online:2009-11-01 Published:2009-11-01
Contact: WANG Jing-lian

求解优化调度问题的仿真计算新方法

王静莲¹，刘弘²，柳新华¹，李少辉²

1.鲁东大学现代教育技术教学部，山东烟台 264025
2.山东师范大学信息科学与工程学院，济南 250014

通讯作者: 王静莲

Abstract

Abstract: The optimized scheduling problem is NP-complete hard in the computer field and the paper discusses the simulation calculation of the cultural algorithm for solving the problem.This paper has formalized the problem in the math model.And then has solved the problem based on the three main genetic operators，it has applied the improved cultural algorithm whose belief spaces have innovated in being generalized corresponding to the n-dimension solution spaces.The experimental results have indicated the feasibility，the correctness and the superiority to the traditional GA.

Key words: cultural algorithm, generalized belief space, scheduling problem, NP-complete hard

摘要： 优化调度问题是计算机领域的NP完全难问题，论文探讨了求解该问题的改进文化算法仿真计算。用数学模型形式化该问题。基于三个主要遗传算子，创新地采用可对应N维解空间广义信念空间定义的文化算法求解问题。大量仿真实验结果表明了算法的可行性、正确性和较传统GA的优越性。

关键词: 文化算法, 广义信念空间, 调度问题, NP完全难

CLC Number:

TP301.6

WANG Jing-lian¹，LIU Hong²，LIU Xin-hua¹，LI Shao-hui². New simulation-calculation method of solving optimized scheduling problem[J]. Computer Engineering and Applications, 2009, 45(31): 37-39.

王静莲¹，刘弘²，柳新华¹，李少辉². 求解优化调度问题的仿真计算新方法[J]. 计算机工程与应用, 2009, 45(31): 37-39.

[1]	SHI Yuqiang, TIAN Yongzheng, ZHANG Yuqi, SHI Xiaoqiu. Solving FJSP by Multi-population Genetic Algorithms with Complex Network Structure [J]. Computer Engineering and Applications, 2021, 57(2): 257-266.
[2]	BAI Shouhua, GUO Guangsong, HU Tiantong. Multi-modal Hybrid Index Optimization by Interactive Multi-objective Cultural Algorithm [J]. Computer Engineering and Applications, 2021, 57(17): 80-87.
[3]	GUO Jiali, WANG Qiuping, WANG Xiaofeng. Hybrid Moth Flame Algorithm with Learning Strategy and Neighboring Search [J]. Computer Engineering and Applications, 2021, 57(12): 170-179.
[4]	WU Shujing, YOU Youpeng, LUO Fuyuan. Genetic-Variable Neighborhood Search Algorithm with Elite Protection Strategy for Flexible Job Shop Scheduling Problem [J]. Computer Engineering and Applications, 2020, 56(22): 236-243.
[5]	YIN Jianjin1, ZHANG Beike1, GAO Dong1, XU Xin2. Improved Bat Algorithm for Solving Flexible Flow Shop Scheduling Problem and Its Application [J]. Computer Engineering and Applications, 2019, 55(9): 243-247.
[6]	YAN Xu, YE Chunming. Hybrid Grasshopper Optimization Algorithm for Job-Shop Scheduling Problem [J]. Computer Engineering and Applications, 2019, 55(6): 257-264.
[7]	ZENG Qiang1, DENG Jingyuan1, ZHANG Jinchun1, SHEN Ling2. Optimization Scheduling Method Based on GA for FSP Under Multiple Work Calendars [J]. Computer Engineering and Applications, 2019, 55(4): 238-247.
[8]	LUO Xiong, QIAN Qian, FU Yunfa. Review of Application of Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems [J]. Computer Engineering and Applications, 2019, 55(23): 15-21.
[9]	JU Luyan1, YANG Jianjun2, ZHANG Jianbing1, GUO Longlong1, LI Suobin1. Improved NSGA for Multi-Objective Flexible Job-Shop Scheduling Problem [J]. Computer Engineering and Applications, 2019, 55(13): 260-265.
[10]	WU Dongkai, ZHANG Fengbin, XI Liang. Research on clonal selection algorithm of adaptive hybrid mutation [J]. Computer Engineering and Applications, 2018, 54(21): 78-83.
[11]	LI Fan1, GAO Dong1, XU Xin2, ZHANG Yuliang2. Research of improved bat algorithm for flexible job-shop scheduling problem [J]. Computer Engineering and Applications, 2018, 54(21): 265-270.
[12]	QU Chiwen1, FU Yanming2, LUO Mingshan1, LIN Chengde1, HE Wei1. Solving flexible job-shop scheduling problem using bird swarm algorithm [J]. Computer Engineering and Applications, 2018, 54(17): 249-257.
[13]	YANG Yujun, CHEN Ye. Hybrid ant colony optimization for flexible robotic manufacturing cell scheduling problem [J]. Computer Engineering and Applications, 2018, 54(13): 160-167.
[14]	ZHANG Wenpeng, WANG Xing. Application of improved bat algorithm to JSP [J]. Computer Engineering and Applications, 2017, 53(8): 137-140.
[15]	CHEN Qinglan1, LIN Kunting2, WEI Chiu-Chi2. Application of ACO algorithm and different scheduling rules in multi-objective resource-constrained project scheduling problem—modification and comparison with different scheduling rules [J]. Computer Engineering and Applications, 2017, 53(5): 249-254.

New simulation-calculation method of solving optimized scheduling problem

求解优化调度问题的仿真计算新方法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics