S. Chandrasekaran, S. Ponnambalam, R. Suresh, N. Vijayakumar
{"title":"求解流水车间调度问题的混合离散粒子群算法","authors":"S. Chandrasekaran, S. Ponnambalam, R. Suresh, N. Vijayakumar","doi":"10.1109/ICCIS.2006.252316","DOIUrl":null,"url":null,"abstract":"This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems\",\"authors\":\"S. Chandrasekaran, S. Ponnambalam, R. Suresh, N. Vijayakumar\",\"doi\":\"10.1109/ICCIS.2006.252316\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective\",\"PeriodicalId\":296028,\"journal\":{\"name\":\"2006 IEEE Conference on Cybernetics and Intelligent Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Conference on Cybernetics and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIS.2006.252316\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Conference on Cybernetics and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS.2006.252316","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems
This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
