期刊文献+

智能混合优化策略及其在流水作业调度中的应用 被引量:10

Intelligent Hybrid Optimization Strategy and Its Application to Flow-Shop Scheduling
下载PDF
导出
摘要 通过结合蚁群算法(ACO)的并行搜索结构和模拟退火算法(SA)的概率突跳性,提出了一种有效的混合优化策略,并将该策略应用于流水作业调度问题(FSP).在该策略中,蚁群系统的一个周游路线为模拟退火算法提供了一系列初始解,在每个退火温度上进行抽样准则检验并产生新解,然后更新信息激素;蚁群算法再利用模拟退火算法产生的新解进行并行搜索.同时,根据此策略构建并实现了针对FSP问题求解的具体混合算法.仿真结果表明,混合算法弥补了ACO易陷入局部最优和SA搜索效率较低的缺点,增强了全局搜索能力,在求解FSP调度问题的性能上也优于其他算法. By combining the parallel searching structure of ant colony optimization (ACO) with the probabilistic jumping property of simulated annealing (SA), an effective hybrid optimization strategy was developed, and applied to flow-shop scheduling problems (FSP). In the hybrid strategy, a cycle course of the ant system can provide effective initial solutions for SA, and SA generates new solutions based on the metropolis criterion at each temperature, then the ant system updates pheromone trails and proceeds with parallel searching through reusing the new solutions from SA. Meanwhile, the hybrid algorithm for flow-shop scheduling problems is created and realized on the basis of the hybrid strategy. With some benchmark FSP problems, the simulation results show that the method compensates the deficiency of ACO that is easy to be run into local optimum and SA that has lower efficiency, and strengthens the global search ability. Compared with other algorithms for solving FSP, the proposed method has better performance.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2004年第8期779-782,共4页 Journal of Xi'an Jiaotong University
基金 国家自然科学基金资助项目(60175015) 国家"211工程"资助项目.
关键词 蚁群算法 模拟退火算法 混合优化算法 流水作业调度 Optimization Parallel algorithms Simulated annealing
  • 相关文献

参考文献9

  • 1Garey E L, Johnson D S, Sethi R. The complexity of flow-shop and job-shop scheduling [J]. Mathematics of Operations Research, 1976, 1(1):117-129.
  • 2Osman I, Potts C. Simulated annealing for permutation flow-shop scheduling [J]. Omega, 1989,17(6): 551-557.
  • 3Taillard E. Some efficient heuristic methods for flow-shop sequencing [J]. European Journal of Operational Research, 1990,47(1):65-74.
  • 4Stutzle T. An ant approach to the flow shop problem [A]. European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany,1998.
  • 5Dorigo M, Caro G D. Ant colony optimization: a new meta-heuristic [A]. Int Conf on Evolutionary Computation, Piscataway, USA, 1999.
  • 6Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem [J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
  • 7Stutzle T, Hoos H H. The max-min ant system and local search for the traveling salesman problem [A]. IEEE 4th International Conference on Evolutionary Computation, Piscataway, USA,1997.
  • 8Stutzle T, Hoos H H. Max-min ant system [J]. Future Generation Computer Systems, 2000,16(8):889-914.
  • 9Hajek B. Cooling schedules for optimal annealing [J]. Mathematics of Operations Research, 1988, 13(2):311-329.

同被引文献75

引证文献10

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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