周蓉, 袁坤. 求解车间调度问题的改进型交叉配对策略[J]. 南昌航空大学学报(自然科学版), 2011, 25(4): 56-57.
引用本文: 周蓉, 袁坤. 求解车间调度问题的改进型交叉配对策略[J]. 南昌航空大学学报(自然科学版), 2011, 25(4): 56-57.
ZHOU Rong, YUAN Kun. An Improved Method of Selecting Crossover Individuals for Job Shop Scheduling[J]. Journal of nanchang hangkong university(Natural science edition), 2011, 25(4): 56-57.
Citation: ZHOU Rong, YUAN Kun. An Improved Method of Selecting Crossover Individuals for Job Shop Scheduling[J]. Journal of nanchang hangkong university(Natural science edition), 2011, 25(4): 56-57.

求解车间调度问题的改进型交叉配对策略

An Improved Method of Selecting Crossover Individuals for Job Shop Scheduling

  • 摘要: 针对作业车间调度问题,以最小完工时间为目标,提出了一种基于"国王配对"的改进型配对策略。该方法的改进之处是对交叉算子进行子代选择时,借鉴了父子竞争机制进行选择,提高了算法的收敛速度,减少了最短加工时间,并运用Matlab实现了该算法。通过一个10个工件、10台机床作业车间调度的测试实验,验证了该算法优于采用"国王配对"选择个体的遗传算法。

     

    Abstract: Aiming at the minimal makespan of job shop scheduling,a method named an improved"king strategy"for selecting crossover individuals is proposed in this paper.The improvement of crossover operator is selecting offspring based on father and son competition mechanism.Then these algorithms were operated in Matlab.A 10-jobs-and-10-machine JSP is given and the simulation results indicated the convergence rate and search precision of IKGA are remarkably better than the genetic algorithms based on"king strategy"for selecting crossover individuals.

     

/

返回文章
返回