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

混沌微粒群算法在离散型生产调度中的应用
引用本文:陈宇航,刘阶萍,秦智晗.混沌微粒群算法在离散型生产调度中的应用[J].铁路计算机应用,2012,21(3):4-8.
作者姓名:陈宇航  刘阶萍  秦智晗
作者单位:北京交通大学 机械与电子控制工程学院,北京,100044
摘    要:本文基于离散型生产调度问题的定义、约束条件,建立了相应的数学模型,针对微粒群算法后期容易陷入局部最优解且收敛速度慢的特点,提出了混沌的微粒群算法.详细介绍了混沌微粒群算法在离散型生产调度的优化流程,并将该算法用于实际项目,进行优化求解,与基本的微粒群算法对比得出更好的结果,验证了混沌微粒群算法的优越性.

关 键 词:微粒群算法    离散型生产调度    混沌
收稿时间:2012-03-15

Application of CPSO in Job-shop Scheduling
CHEN Yu-hang , LIU Jie-ping , QIN Zhi-han.Application of CPSO in Job-shop Scheduling[J].Railway Computer Application,2012,21(3):4-8.
Authors:CHEN Yu-hang  LIU Jie-ping  QIN Zhi-han
Institution:( School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing 100044, China )
Abstract:This paper firstly summarized the definition and constraints condition of Job-shop Scheduling Problem, established a relevant mathematics model. For the property that Particle Swarm Optimization Algorithm would easily sink into local extreme point and its slow convergence speed in later stage, Chaotic Particle Swarm Optimization(CPSO) was proposed to make up for this defect. This paper specifically introduced optimal process of CPSO in Job-shop Scheduling, and utilized the algorithm to calculate the actual project examples, which achieved the optimal solution. Compared to basic Particle Swarm Algorithm, it obtained the better result. After verification, CPSO had more advantages. The following illustrated the improvements.
Keywords:Particle Swarm Optimization Algorithm  Job-shop  Scheduling  Chaos
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《铁路计算机应用》浏览原始摘要信息
点击此处可从《铁路计算机应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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