基于混合量子粒子群算法(HQPSO)的流水车间调度问题

2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI:10.1109/CINC.2010.5643845

Qunxian Chen

{"title":"基于混合量子粒子群算法(HQPSO)的流水车间调度问题","authors":"Qunxian Chen","doi":"10.1109/CINC.2010.5643845","DOIUrl":null,"url":null,"abstract":"The flow shop scheduling problem is a combinatorial optimization problem known to be NP-hard, which has captured the interest of a great number of researchers. Many different methods have been applied to solve FSSP and have obtained effective results, but these methods are not satisfying. Based on the quantum theory and particle swarm optimization ,this paper presents an HQPSO algorithm to solve FSSP. Experimental results show that the HQPSO algorithm for FSSP improves the search performance and shows the effectiveness of the algorithm to solve optimization problems..","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Flow shop scheduling problem using hybrid quantum particle swarm optimization algorithm(HQPSO)\",\"authors\":\"Qunxian Chen\",\"doi\":\"10.1109/CINC.2010.5643845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The flow shop scheduling problem is a combinatorial optimization problem known to be NP-hard, which has captured the interest of a great number of researchers. Many different methods have been applied to solve FSSP and have obtained effective results, but these methods are not satisfying. Based on the quantum theory and particle swarm optimization ,this paper presents an HQPSO algorithm to solve FSSP. Experimental results show that the HQPSO algorithm for FSSP improves the search performance and shows the effectiveness of the algorithm to solve optimization problems..\",\"PeriodicalId\":227004,\"journal\":{\"name\":\"2010 Second International Conference on Computational Intelligence and Natural Computing\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computational Intelligence and Natural Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CINC.2010.5643845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2010.5643845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

流车间调度问题是一个np困难的组合优化问题，引起了许多研究者的兴趣。许多不同的方法被应用于求解FSSP，并获得了有效的结果，但这些方法都不令人满意。基于量子理论和粒子群算法，提出了求解FSSP问题的HQPSO算法。实验结果表明，HQPSO算法提高了FSSP的搜索性能，显示了该算法解决优化问题的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Flow shop scheduling problem using hybrid quantum particle swarm optimization algorithm(HQPSO)

The flow shop scheduling problem is a combinatorial optimization problem known to be NP-hard, which has captured the interest of a great number of researchers. Many different methods have been applied to solve FSSP and have obtained effective results, but these methods are not satisfying. Based on the quantum theory and particle swarm optimization ,this paper presents an HQPSO algorithm to solve FSSP. Experimental results show that the HQPSO algorithm for FSSP improves the search performance and shows the effectiveness of the algorithm to solve optimization problems..

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 Second International Conference on Computational Intelligence and Natural Computing

自引率

0.00%

发文量