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

混流装配线调度问题的离散粒子群优化解
引用本文:田志友,田澎,王浣尘.混流装配线调度问题的离散粒子群优化解[J].工业工程与管理,2005,10(6):8-11.
作者姓名:田志友  田澎  王浣尘
作者单位:1. 上海质量管理科学研究院,上海,200050
2. 上海交通大学管理学院,上海,200052
基金项目:国家自然科学基金资助项目(No.70271040)
摘    要:混流装配线调度问题是JIT生产中的一个重要问题。借鉴二进制遗传算法中的交叉操作过程,对传统的连续型粒子群算法进行改进,使其适用于离散问题的优化处理。然后以丰田公司的汽车组装调度函数作为目标函数,利用改进的离散粒子群算法进行求解。对比分析表明:新算法所得结果优于常用的目标追随法、遗传算法、模拟退火等方法。

关 键 词:混流装配线  粒子群优化  交叉操作  调度问题
文章编号:1007-5429(2005)06-0008-04
收稿时间:2004-10-25
修稿时间:2004-10-252004-12-25

Solutions to the Scheduling Problem of Mixed-Model Assembly Lines Based on the Discrete Particle Swarm Optimization
TIAN Zhi-you,TIAN Peng,WANG Huan-chen.Solutions to the Scheduling Problem of Mixed-Model Assembly Lines Based on the Discrete Particle Swarm Optimization[J].Industrial Engineering and Management,2005,10(6):8-11.
Authors:TIAN Zhi-you  TIAN Peng  WANG Huan-chen
Affiliation:1 Shanghai Academy of Quality Management, Shanghai 200050, China; 2 School of Management, Shanghai Jiao Tong University, 200052, China
Abstract:Solving the scheduling problem is a most important goal for JIT production systems.By referring to the crossover operations in the genetic algorithms,the classic particle swarm optimization(PSO) is adapted to discrete combination problems.Then taking the Toyota's mixed-model scheduling function as the target function,the adapted discrete PSO algorithm is used to solve that problem,and the satisfactory feasible solutions are achieved.The comparison results showed that the solutions produced by PSO are better than that of Toyota's Goal Chasing algorithm,genetic algorithm and simulated annealing algorithm.
Keywords:Mixed-model assembly lines  particle swarm optimization  crossover operations  scheduling
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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