首页 | 本学科首页   官方微博 | 高级检索  
     

基于提前/滞后Flow Shop调度问题的混合微粒群算法
引用本文:柳毅,叶春明,马慧民. 基于提前/滞后Flow Shop调度问题的混合微粒群算法[J]. 系统管理学报, 2006, 15(4): 294-298
作者姓名:柳毅  叶春明  马慧民
作者单位:上海理工大学,管理学院,上海,200093
基金项目:上海市教委资助项目;上海市重点学科建设项目
摘    要:提出了一种混合微粒群算法,通过引入禁忌搜索算法和动态设置惯性权重等方法,提高了算法搜索全局最优解的能力并且能够有效避免早熟收敛问题。并将这种算法应用于求解实际的提前/滞后F lowShop调度问题,仿真实验结果表明了混合微粒群算法的可靠性与实用性。

关 键 词:提前/滞后Flow Shop调度问题  微粒群算法  禁忌搜索算法
文章编号:1005-2542(2006)04-0294-05
修稿时间:2005-06-18

A Hybrid PSO Algorithm for Flow Shop Scheduling Problem with Earliness/Tardiness
LIU Yi,YE Chun-ming,MA Hui-min. A Hybrid PSO Algorithm for Flow Shop Scheduling Problem with Earliness/Tardiness[J]. Systems Engineering Theory·Methodology·Applications, 2006, 15(4): 294-298
Authors:LIU Yi  YE Chun-ming  MA Hui-min
Abstract:This paper presents the hybrid particle swarm optimization(PSO) algorithm which using taboo searching algorithm,alterable setting of weight inertia,etc.The improved algorithm has high ability of searching the global optimum solution and avoiding the premature convergence problem effectively.The hybrid PSO can be applied to solve flow shop scheduling problem with earliness and tardiness,and experiment results demonstrate that the proposed algorithm have reliability,practicability and efficient value in the engineering application.
Keywords:flow shop scheduling problem with earliness/tardiness  particle swarm optimization(PSO)  taboo searching algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号