期刊文献+

基于位置与连接概率的EDA算法求解PFSP问题

SOLVING PFSP WITH POSITION AND CONNECTION PROBABILITY-BASED EDA
下载PDF
导出
摘要 针对置换流水车间调度问题(PFSP)的特点,提出一种基于工件加工位置与连接概率相结合的混合分布估计算法。该算法将工件位置概率与工件的连接概率结合在一起,作为新一代种群的生成概率从而使得进化趋势更加合理化。为了提高局部搜索能力,算法引入了启发式方法提高初始解质量,优化了邻域搜索策略。同时引入了变异操作及限定操作来提高算法全局搜索能力。实验结果表明,该算法在求解置换流水车间调度问题时具有良好的性能。 Aiming at the characteristics of the permutation flow shop scheduling problem( PFSP),this paper proposed a hybrid estimation of distribution algorithm( EDA) which is based on the combination of workpiece machining position and connection probability. The algorithm combines the probabilities of workpiece location and workpiece connection together to be the generation probability of new-generation population so as to make the evolution trend more reasonable. To improve local search ability,the algorithm introduces heuristic methods to improve the quality of initial solution,and optimises neighbourhood search strategy. At the same time,the mutation and limitation operations are introduced as well to enhance the global search ability. Experimental results demonstrated that the algorithm had good performance in solving PFSP.
出处 《计算机应用与软件》 CSCD 2015年第12期261-264,273,共5页 Computer Applications and Software
基金 辽宁省教育厅资助项目(L2013539)
关键词 分布估计算法 置换流水车间调度问题 邻域搜索 位置概率 连接概率 Estimation of distribution algorithms Permutation flow-shop scheduling problem Neighbourhood search Position probability Connection probability
  • 相关文献

参考文献11

二级参考文献138

  • 1潘全科,朱剑英.基于进化算法和模拟退火算法的混合调度算法[J].机械工程学报,2005,41(6):224-227. 被引量:21
  • 2潘全科,朱剑英.一类解决Job Shop问题的禁忌搜索算法[J].中国机械工程,2006,17(5):536-539. 被引量:16
  • 3陈璐,奚立峰,蔡建国,Nathalie Bostel,Pierre Dejax.一种求解带有阻塞限制的混合流水车间的禁忌搜索算法[J].上海交通大学学报,2006,40(5):856-859. 被引量:11
  • 4周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 5Lin S, Kernighan B W. An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 1973, 21 : 498 -516.
  • 6Helsgann K. An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal of Operational Research, 2000, 126(1) :106 -130.
  • 7Mtthlenbein H, Paass G. From Recombination of Genes to the Esti- mation of Distributions I. Binary Parameters//Proc of the 4th International Conference on Parallel Problem Solving from Nature. Berlin, Germany, 1996 : 178 - 187.
  • 8Tsutsui S. Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram //Proc of the 7th Parallel Problem Solving from Nature. Granada, Spain, 2002 : 224 - 233.
  • 9Larranaga P, Lozano J A. Estimation of Distribution Algorithms. Dordrecht, Netherlands : Kluwer Academic Publishers, 2002.
  • 10Ventresca M, Tizhoosh H R. A Diversity Maintaining Population- Based Incremental Learning Algorithm. Information Sciences, 2008, 178(21 ) : 4038 -4056.

共引文献277

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部