{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:18:32Z","timestamp":1765484312199,"version":"3.41.2"},"reference-count":32,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJICC"],"published-print":{"date-parts":[[2023,5,15]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Multi-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>In this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>In order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>In order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.<\/jats:p><\/jats:sec>","DOI":"10.1108\/ijicc-04-2022-0118","type":"journal-article","created":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T09:59:26Z","timestamp":1660903166000},"page":"250-276","source":"Crossref","is-referenced-by-count":7,"title":["Multi-objective particle swarm optimization algorithm using Cauchy mutation and improved crowding distance"],"prefix":"10.1108","volume":"16","author":[{"given":"Qingxia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0881-459X","authenticated-orcid":false,"given":"Wenhong","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"2","key":"key2023071410503704400_ref001","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/coin.12258","article-title":"Elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem","volume":"36","year":"2020","journal-title":"Computational Intelligence"},{"issue":"1","key":"key2023071410503704400_ref002","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1162\/EVCO_a_00104","article-title":"D2MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces","volume":"22","year":"2014","journal-title":"Evolutionary Computation"},{"issue":"9","key":"key2023071410503704400_ref003","doi-asserted-by":"crossref","first-page":"3903","DOI":"10.1016\/j.asoc.2013.04.015","article-title":"Attributed multi-objective comprehensive learning particle swarm optimization for optimal security of networks","volume":"13","year":"2013","journal-title":"Applied Soft Computing"},{"issue":"20","key":"key2023071410503704400_ref004","doi-asserted-by":"crossref","first-page":"9979","DOI":"10.1007\/s00500-018-3553-7","article-title":"Software requirement optimization using a fuzzy artificial chemical reaction optimization algorithm","volume":"23","year":"2019","journal-title":"Soft Computing"},{"issue":"3","key":"key2023071410503704400_ref005","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00766-020-00328-y","article-title":"Parallel multi-objective artificial bee colony algorithm for software requirement optimization","volume":"25","year":"2020","journal-title":"Requirements Engineering"},{"key":"key2023071410503704400_ref006","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.neucom.2012.08.074","article-title":"Improved multi-objective particle swarm optimization with preference strategy for optimal DG integration into the distribution system","volume":"148","year":"2015","journal-title":"Neurocomputing"},{"issue":"4","key":"key2023071410503704400_ref007","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: solving problems with box constraints","volume":"18","year":"2014","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"key2023071410503704400_ref008","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"key2023071410503704400_ref009","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1016\/j.aej.2021.08.058","article-title":"A novel ant colony algorithm for solving shortest path problems with fuzzy arc weights","volume":"61","year":"2022","journal-title":"Alexandria Engineering Journal"},{"key":"key2023071410503704400_ref010","first-page":"61","article-title":"An interactive framework to compare multi-criteria optimization algorithms: preliminary results on NSGA-II and MOPSO. 2020 international conference on communication","volume":"733","year":"2021","journal-title":"Computing and Electronics Systems"},{"issue":"2","key":"key2023071410503704400_ref011","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1504\/IJADS.2015.069610","article-title":"Particle swarm optimisation algorithm for solving shortest path problems with mixed fuzzy arc weights","volume":"8","year":"2015","journal-title":"International Journal of Applied Decision Sciences"},{"key":"key2023071410503704400_ref012","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.measurement.2016.06.050","article-title":"A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights","volume":"93","year":"2016","journal-title":"Journal of the International Measurement Confederation"},{"issue":"4","key":"key2023071410503704400_ref013","first-page":"1","article-title":"Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem","volume":"7","year":"2021","journal-title":"Complex and Intelligent Systems"},{"first-page":"266","article-title":"MOPSOhv: a new hypervolume-based multi-objective particle swarm optimizer","year":"2014","key":"key2023071410503704400_ref014"},{"issue":"2","key":"key2023071410503704400_ref015","first-page":"230","article-title":"An effective fault-tolerance technique in web services: an approach based on hybrid optimization algorithm of PSO and cuckoo search","volume":"19","year":"2022","journal-title":"The International Arab Journal of Information Technology"},{"issue":"4","key":"key2023071410503704400_ref016","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1049\/iet-sen.2019.0018","article-title":"Efficient improved ant colony optimisation algorithm for dynamic software rejuvenation in web services","volume":"14","year":"2020","journal-title":"IET Software"},{"first-page":"3148","article-title":"R2-MOPSO: a multi-objective particle swarm optimizer based on R2-indicator and decomposition","year":"2015","key":"key2023071410503704400_ref017"},{"key":"key2023071410503704400_ref018","doi-asserted-by":"crossref","first-page":"14710","DOI":"10.1109\/ACCESS.2018.2812701","article-title":"A hybrid multiobjective particle swarm optimization algorithm based on R2 indicator","volume":"6","year":"2018","journal-title":"IEEE Access"},{"key":"key2023071410503704400_ref019","doi-asserted-by":"crossref","first-page":"168091","DOI":"10.1109\/ACCESS.2019.2954542","article-title":"A multi-objective particle swarm optimization algorithm based on enhanced selection","volume":"7","year":"2019","journal-title":"IEEE Access"},{"key":"key2023071410503704400_ref020","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.swevo.2019.02.003","article-title":"Comparison between MOEA\/D and NSGA-III on a set of many and multi-objective benchmark problems with challenging difficulties","volume":"46","year":"2019","journal-title":"Swarm and Evolutionary Computation"},{"issue":"9","key":"key2023071410503704400_ref021","first-page":"2085","article-title":"R2 indicator and objective space partition based many-objective particle swarm optimizer","volume":"36","year":"2021","journal-title":"Kongzhi yu Juece\/Control and Decision"},{"issue":"2","key":"key2023071410503704400_ref022","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1080\/00207721.2018.1552765","article-title":"Handling many-objective optimisation problems with R2 indicator and decomposition-based particle swarm optimiser","volume":"50","year":"2019","journal-title":"International Journal of Systems Science"},{"issue":"2","key":"key2023071410503704400_ref023","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s12065-020-00436-2","article-title":"Non-dominated Sorting Genetic Algorithm (NSGA-III) for effective resource allocation in cloud","volume":"14","year":"2021","journal-title":"Evolutionary Intelligence"},{"issue":"3","key":"key2023071410503704400_ref024","doi-asserted-by":"crossref","first-page":"5027","DOI":"10.3233\/JIFS-201759","article-title":"A novel approach for the next software release using a binary artificial algae algorithm","volume":"40","year":"2021","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"key2023071410503704400_ref025","article-title":"A self-organized speciation based multi-objective particle swarm optimizer for multimodal multi-objective problems","volume":"86","year":"2020","journal-title":"Applied Soft Computing"},{"first-page":"257","article-title":"An effective use of crowding distance in multiobjective particle swarm optimization","year":"2005","key":"key2023071410503704400_ref026"},{"first-page":"1324","article-title":"Hybrid many-objective particle swarm optimization set-evolution","year":"2014","key":"key2023071410503704400_ref027"},{"key":"key2023071410503704400_ref028","doi-asserted-by":"crossref","first-page":"3762","DOI":"10.1007\/s10489-018-1170-x","article-title":"A novel multi-objective optimization algorithm based on artificial algae for multi-objective engineering design problems","volume":"48","year":"2018","journal-title":"Applied Intelligence"},{"first-page":"1","article-title":"A many-objective particle swarm optimization based on virtual pareto front","year":"2018","key":"key2023071410503704400_ref029"},{"key":"key2023071410503704400_ref030","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ins.2018.04.062","article-title":"Surrogate-assisted hierarchical particle swarm optimization","volume":"454-455","year":"2018","journal-title":"Information Sciences"},{"issue":"1","key":"key2023071410503704400_ref031","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","article-title":"Multi-objective evolutionary algorithms: a survey of the state-of-the-art","volume":"1","year":"2011","journal-title":"Swarm and Evolutionary Computation"},{"issue":"9","key":"key2023071410503704400_ref032","doi-asserted-by":"crossref","first-page":"2794","DOI":"10.1109\/TCYB.2017.2710133","article-title":"An external archive-guided multiobjective particle swarm optimization algorithm","volume":"47","year":"2017","journal-title":"IEEE Transactions on Cybernetics"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-04-2022-0118\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-04-2022-0118\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:54:17Z","timestamp":1753397657000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/16\/2\/250-276\/122639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":32,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,8,22]]},"published-print":{"date-parts":[[2023,5,15]]}},"alternative-id":["10.1108\/IJICC-04-2022-0118"],"URL":"https:\/\/doi.org\/10.1108\/ijicc-04-2022-0118","relation":{},"ISSN":["1756-378X"],"issn-type":[{"type":"print","value":"1756-378X"}],"subject":[],"published":{"date-parts":[[2022,8,22]]}}}