摘要
提出了一种改进的具有全局搜索能力的微粒群算法,对工件尺寸有差异的单机批调度问题的制造跨度进行优化。针对问题中工件尺寸不同且分批加工的特点,设计了微粒的编码方式;对进化过程中产生的极优解,采用了混沌优化策略进行改进,避免早熟收敛的问题。仿真实验结果表明,本文算法的时间性能和近似解质量均优于现有的其他方法。
An improved particle swarm optimization algorithm with global search ability is proposed to min-imize the makespan of a single batch-processing machine with non-identical job sizes. The coding method of the algorithm is designed according to the processing of non-identical jobs. The global best solutions are improved using a chaotic scheme to avoid the immature convergence. The simulation results demonstrate that the proposed algorithm outperforms the other algorithm on the run time and the quality of solutions.
出处
《中国管理科学》
CSSCI
2008年第3期84-88,共5页
Chinese Journal of Management Science
基金
国家冉然科学基金(70671096)
香港
澳门青年学者合作研究基金(70629002)
关键词
生产调度
批处理机
不同尺寸工件
混沌
微粒群算法
scheduling
batch-processing machine
non-identical job
chaos
particle swarm optimization
