Particle swarm optimization is a popular nature-inspired metaheuristic algorithm and has been used extensively to solve single- and multi-objective optimization problems over the last two decades. Several local and global search strategies, and learning and parameter adaptation strategies have been included in particle swarm optimization to improve its performance over the years. Most of these approaches are observed to increase the number of user-defined parameters and algorithmic steps resulting in an increased complexity of the algorithm. This paper presents a simplified multi-objective particle swarm optimization algorithm in which the exploitation (guided) and exploration (random) moves are simplified using a detailed qualitative analysis of similar existing operators present in the real-coded elitist non-dominated sorting genetic algorithm and the particle swarm optimization algorithm. The developed algorithm is then tested quantitatively on 30 well-known benchmark problems and compared with a real-coded elitist non-dominated sorting genetic algorithm, and its variant with a simulated binary jumping gene operator and multi-objective non-dominated sorting particle swarm optimization algorithm. In the comparison, the developed algorithm is found to be superior in terms of convergence speed. It is also found to be better with respect to four recent multi-objective particle swarm optimization algorithms and four differential evolution variants in an extended comparative analysis. Finally, it is applied to a newly formulated industrial multi-objective optimization problem of a residue (bottom product from the crude distillation unit) fluid catalytic cracking unit where it shows a better performance than the other compared algorithms.
{"title":"A simplified multi-objective particle swarm optimization algorithm","authors":"Vibhu Trivedi, Pushkar Varshney, Manojkumar Ramteke","doi":"10.1007/s11721-019-00170-1","DOIUrl":"https://doi.org/10.1007/s11721-019-00170-1","url":null,"abstract":"Particle swarm optimization is a popular nature-inspired metaheuristic algorithm and has been used extensively to solve single- and multi-objective optimization problems over the last two decades. Several local and global search strategies, and learning and parameter adaptation strategies have been included in particle swarm optimization to improve its performance over the years. Most of these approaches are observed to increase the number of user-defined parameters and algorithmic steps resulting in an increased complexity of the algorithm. This paper presents a simplified multi-objective particle swarm optimization algorithm in which the exploitation (guided) and exploration (random) moves are simplified using a detailed qualitative analysis of similar existing operators present in the real-coded elitist non-dominated sorting genetic algorithm and the particle swarm optimization algorithm. The developed algorithm is then tested quantitatively on 30 well-known benchmark problems and compared with a real-coded elitist non-dominated sorting genetic algorithm, and its variant with a simulated binary jumping gene operator and multi-objective non-dominated sorting particle swarm optimization algorithm. In the comparison, the developed algorithm is found to be superior in terms of convergence speed. It is also found to be better with respect to four recent multi-objective particle swarm optimization algorithms and four differential evolution variants in an extended comparative analysis. Finally, it is applied to a newly formulated industrial multi-objective optimization problem of a residue (bottom product from the crude distillation unit) fluid catalytic cracking unit where it shows a better performance than the other compared algorithms.","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"22 1","pages":"1 - 34"},"PeriodicalIF":2.6,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138538379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-06-26DOI: 10.1007/s11721-019-00169-8
Judhi Prasetyo, Giulia de Masi, E. Ferrante
{"title":"Collective decision making in dynamic environments","authors":"Judhi Prasetyo, Giulia de Masi, E. Ferrante","doi":"10.1007/s11721-019-00169-8","DOIUrl":"https://doi.org/10.1007/s11721-019-00169-8","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"13 1","pages":"217 - 243"},"PeriodicalIF":2.6,"publicationDate":"2019-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-019-00169-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43331114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-06-11DOI: 10.1007/s11721-019-00166-x
Siddharth Mayya, S. Wilson, M. Egerstedt
{"title":"Closed-loop task allocation in robot swarms using inter-robot encounters","authors":"Siddharth Mayya, S. Wilson, M. Egerstedt","doi":"10.1007/s11721-019-00166-x","DOIUrl":"https://doi.org/10.1007/s11721-019-00166-x","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"13 1","pages":"115 - 143"},"PeriodicalIF":2.6,"publicationDate":"2019-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-019-00166-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52793186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-05-14DOI: 10.1007/s11721-019-00165-y
C. L. Camacho-Villalón, M. Dorigo, T. Stützle
{"title":"The intelligent water drops algorithm: why it cannot be considered a novel algorithm","authors":"C. L. Camacho-Villalón, M. Dorigo, T. Stützle","doi":"10.1007/s11721-019-00165-y","DOIUrl":"https://doi.org/10.1007/s11721-019-00165-y","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"13 1","pages":"173 - 192"},"PeriodicalIF":2.6,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-019-00165-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52793002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-04DOI: 10.1007/s11721-019-00162-1
Guannan Li, Ivan Svogor, G. Beltrame
{"title":"Long-term pattern formation and maintenance for battery-powered robots","authors":"Guannan Li, Ivan Svogor, G. Beltrame","doi":"10.1007/s11721-019-00162-1","DOIUrl":"https://doi.org/10.1007/s11721-019-00162-1","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"13 1","pages":"21 - 57"},"PeriodicalIF":2.6,"publicationDate":"2019-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-019-00162-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52792884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-10DOI: 10.1007/s11721-018-0161-1
Adam Schroeder, B. Trease, A. Arsie
{"title":"Balancing robot swarm cost and interference effects by varying robot quantity and size","authors":"Adam Schroeder, B. Trease, A. Arsie","doi":"10.1007/s11721-018-0161-1","DOIUrl":"https://doi.org/10.1007/s11721-018-0161-1","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"13 1","pages":"1 - 19"},"PeriodicalIF":2.6,"publicationDate":"2018-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-018-0161-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52792819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-16DOI: 10.1007/s11721-018-0160-2
Inmo Jang, Hyo-Sang Shin, A. Tsourdos
{"title":"Local information-based control for probabilistic swarm distribution guidance","authors":"Inmo Jang, Hyo-Sang Shin, A. Tsourdos","doi":"10.1007/s11721-018-0160-2","DOIUrl":"https://doi.org/10.1007/s11721-018-0160-2","url":null,"abstract":"","PeriodicalId":51284,"journal":{"name":"Swarm Intelligence","volume":"29 1","pages":"327 - 359"},"PeriodicalIF":2.6,"publicationDate":"2018-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11721-018-0160-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52792682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：