流车间调度问题的一种具有多样性的混合粒子群优化算法

Shin-Ying Huang, Chuen-Lung Chen
{"title":"流车间调度问题的一种具有多样性的混合粒子群优化算法","authors":"Shin-Ying Huang, Chuen-Lung Chen","doi":"10.1109/ICICIC.2009.21","DOIUrl":null,"url":null,"abstract":"This paper proposed a hybrid particle swarm optimization algorithm (Shadow hybrid PSO, SHPSO) to solve the flow-shop scheduling problem (FSSP). SHPSO adopts the idea of Kuoa's HPSO model[4] by not only combines the random-key (RK) encoding scheme, individual enhancement (IE) scheme, but also adds the diversification mechanism such as ARPSO model and competitive shadow particles to prevent premature convergence. Computation experiments results of Taillard's [10] seven representative instances of FSSP show that the SHPSO perform close to HPSO for FSSP to minimize makespan. Further recommendations and improved ideas will be discussed later in this paper.","PeriodicalId":240226,"journal":{"name":"2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Hybrid Particle Swarm Optimization Algorithm with Diversity for Flow-Shop Scheduling Problem\",\"authors\":\"Shin-Ying Huang, Chuen-Lung Chen\",\"doi\":\"10.1109/ICICIC.2009.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed a hybrid particle swarm optimization algorithm (Shadow hybrid PSO, SHPSO) to solve the flow-shop scheduling problem (FSSP). SHPSO adopts the idea of Kuoa's HPSO model[4] by not only combines the random-key (RK) encoding scheme, individual enhancement (IE) scheme, but also adds the diversification mechanism such as ARPSO model and competitive shadow particles to prevent premature convergence. Computation experiments results of Taillard's [10] seven representative instances of FSSP show that the SHPSO perform close to HPSO for FSSP to minimize makespan. Further recommendations and improved ideas will be discussed later in this paper.\",\"PeriodicalId\":240226,\"journal\":{\"name\":\"2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICIC.2009.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIC.2009.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种混合粒子群优化算法(Shadow hybrid PSO, SHPSO)来解决流车间调度问题(FSSP)。SHPSO采用了Kuoa的HPSO模型[4]的思想,不仅结合了随机密钥(RK)编码方案、个体增强(IE)方案,而且增加了ARPSO模型、竞争阴影粒子等多样化机制,防止过早收敛。Taillard[10]的7个典型FSSP实例的计算实验结果表明,对于最小化最大完工时间的FSSP, SHPSO的性能接近于HPSO。本文稍后将讨论进一步的建议和改进的想法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Hybrid Particle Swarm Optimization Algorithm with Diversity for Flow-Shop Scheduling Problem
This paper proposed a hybrid particle swarm optimization algorithm (Shadow hybrid PSO, SHPSO) to solve the flow-shop scheduling problem (FSSP). SHPSO adopts the idea of Kuoa's HPSO model[4] by not only combines the random-key (RK) encoding scheme, individual enhancement (IE) scheme, but also adds the diversification mechanism such as ARPSO model and competitive shadow particles to prevent premature convergence. Computation experiments results of Taillard's [10] seven representative instances of FSSP show that the SHPSO perform close to HPSO for FSSP to minimize makespan. Further recommendations and improved ideas will be discussed later in this paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信