全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

求解作业车间调度问题的广义粒子群优化算法

, PP. 0-0

Keywords: 粒子群优化,遗传算法,禁忌搜索,作业车间调度

Full-Text   Cite this paper   Add to My Lib

Abstract:

为克服传统粒子群优化算法在解决组合优化问题上的局限性,分析了其优化机理,并在此基础上提出了广义粒子群优化模型。按照此模型提出了一种求解作业车间调度问题的广义粒子群优化算法。在本算法中,利用遗传算法中的交叉操作作为粒子间的信息交换策略,利用遗传算法中的变异操作作为粒子的随机搜索策略,而粒子的局部搜索策略则采用禁忌搜索来实现。为了控制粒子的局部搜索以及向全局最优解的收敛,迭代过程中交叉概率以及禁忌搜索的最大步长都是动态变化的。实验结果表明,本算法可有效地求解作业车间调度问题,验证了广义粒子群优化模型的合理性。

References

[1]  ??KENNEDY J,EBERHART R C.Particle swarm optimization[A].Proceedings of IEEE International Conference on Neural Networks[C].Piscataway,NJ,USA:IEEE Service Center,1995.1942-1948.
[2]  ??YANG Wei,LI Qiqiang.Survey on particle swarm optimization algorithm[J].Engineering Science,2004,6(5):87-94(in Chinese).[杨??维,李歧强.粒子群优化算法综述[J].中国工程科学,2004,6(5):87-94.]
[3]  ??IOAN C T.The particle swarm optimization algorithm:convergence analysis and parameter selection[J].Information Processing Letters,2003,85(6):317-325.
[4]  ??GAO Haibing,GAO Liang,ZHOU Chi,et al.Particle swarm optimization based algorithm for neural network learning[J].ACTA Electronical Sinice,2004,32(9):1572-1574(in Chinese).[高海兵,高??亮,周??驰,等.基于粒子群优化的神经网络训练算法研究[J].电子学报,2004,32(9):1572-1574.]
[5]  ??CARLOS A C,GREGORIO T P,MAXIMINO S L.Handing multiple objectives with particle swarm optimization[J].IEEE Transaction on Evolutionary Computation,2004,8(3):256-279.
[6]  ??CROCE F D,TADEI R,VOLTA G.A genetic algorithm for the job shop problem[J].Computers & Operations Research,1995,22(1):15-24.
[7]  ??ZHANG Chaoyong,RAO Yunqing,LI Peigen,et al.An improved genetic algorithm for job-shop scheduling[J].Computer Integrated Manufacturing Systems,2004,10(8):966-970(in Chinese).[张超勇,饶运清,李培根,等.求解作业车间调度问题的一种改进遗传算法[J].计算机集成制造系统,2004,10(8):966-970.]
[8]  ??BEATRICE M O,MARIO V.Local search genetic algorithms for the job shop scheduling problem[J].Applied Intelligence,2004,21(1):99-109.
[9]  ??KOLONKO M.Some new results on simulated annealing applied to the job shop scheduling problem[J].European Journal of Operational Research,1999,113(1):123-126.
[10]  ??PEZZELLA F,MERELLI E.A tabu search method guided by shifting bottleneck for the job shop scheduling problem[J].European Journal of Operational Research,2000,120(2):297-310.
[11]  ??FARUK G.The strategies and parameters of tabu search for job-shop scheduling[J].Journal of Intelligent Manufacturing,2004,15(4):439-448.
[12]  ??TONG Gang,LI Guangquan,LIU Baokun.A modified taboo search algorithm for the job-shop problem[J].Systems Engineering-Theory & Practice,2001,21(9):48-52(in Chinese).[童??刚,李光泉,刘宝坤.一种用于Jop-Shop调度问题的改进禁忌搜索算法[J].系统工程理论与实践,2001,21(9):48-52.]
[13]  ??ZHOU Pin,LI Xiaoping,ZHANG Hongfang.An ant colony algorithm for job shop scheduling problem[A].Fifth World Congress on Intelligent Control and Automation[C].Piscataway,NJ,USA:IEEE Service Center,2004.2899-2903.
[14]  ??JOSE F G,JORGE J M,MAURICIO G R.A hybrid genetic algorithm for the job shop problem[R].NJ,USA:AT&T Labs Research,2002.
[15]  ??HE Z,WEI C.Extracting rules from fuzzy neural network by particle swarm optimization[A].Proceedings of IEEE International Conference on Evolutionary Computation[C].Piscataway,NJ,USA:IEEE Service Center,1998.74-77.
[16]  ??WANG Kangping, HUANG Lan, ZHOU Chunguang,et al.Particle swarm optimization for traveling salesman problem[A].Proceedings of the Second International Conference on Machine Learning and Cybernetics[C].Piscataway,NJ,USA:IEEE Service Center,2003.1583-1585.
[17]  ??TASGETIREN M F,SEVKLI M,LIANG Y,et al.Particle swarm optimization algorithm for single machine total weighted tardiness problem[A].Congress on Evolutionary Computation[C].Piscataway,NJ,USA:IEEE Service Center,2004.1412-1419.
[18]  ??CAREY E L,JOHNSON D S,SETHI R.The complexity of flowshop and job-shop scheduling[J].Mathematics of Operations Research,1976,1(2):117-129.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133