线性约束优化的粒子群优化算法

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299579

U. Paquet, A. Engelbrecht

{"title":"线性约束优化的粒子群优化算法","authors":"U. Paquet, A. Engelbrecht","doi":"10.1109/CEC.2003.1299579","DOIUrl":null,"url":null,"abstract":"A new PSO algorithm, the linear PSO (LPSO), is developed to optimise functions constrained by linear constraints of the form Ax = b. A crucial property of the LPSO is that the possible movement of particles through vector spaces is guaranteed by the velocity and position update equations. This property makes the LPSO ideal in optimising linearly constrained problems. The LPSO is extended to the converging linear PSO, which is guaranteed to always find at least a local minimum.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"159 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"A new particle swarm optimiser for linearly constrained optimisation\",\"authors\":\"U. Paquet, A. Engelbrecht\",\"doi\":\"10.1109/CEC.2003.1299579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new PSO algorithm, the linear PSO (LPSO), is developed to optimise functions constrained by linear constraints of the form Ax = b. A crucial property of the LPSO is that the possible movement of particles through vector spaces is guaranteed by the velocity and position update equations. This property makes the LPSO ideal in optimising linearly constrained problems. The LPSO is extended to the converging linear PSO, which is guaranteed to always find at least a local minimum.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"159 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 55

摘要

一种新的粒子群算法，线性粒子群算法(LPSO)，被开发来优化由Ax = b形式的线性约束约束的函数。LPSO的一个关键性质是粒子通过向量空间的可能运动是由速度和位置更新方程保证的。这一特性使得LPSO在优化线性约束问题方面非常理想。将该粒子群扩展为收敛的线性粒子群，保证总能找到至少一个局部最小值。

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

查看原文本刊更多论文

A new particle swarm optimiser for linearly constrained optimisation

A new PSO algorithm, the linear PSO (LPSO), is developed to optimise functions constrained by linear constraints of the form Ax = b. A crucial property of the LPSO is that the possible movement of particles through vector spaces is guaranteed by the velocity and position update equations. This property makes the LPSO ideal in optimising linearly constrained problems. The LPSO is extended to the converging linear PSO, which is guaranteed to always find at least a local minimum.

求助全文

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

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量