{"id":"https://openalex.org/W2140882991","doi":"https://doi.org/10.1109/sis.2003.1202243","title":"Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)","display_name":"Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2140882991","doi":"https://doi.org/10.1109/sis.2003.1202243","mag":"2140882991"},"language":"en","primary_location":{"id":"doi:10.1109/sis.2003.1202243","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2003.1202243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"S. Mostaghim","raw_affiliation_strings":["Electrical Engineering Department, Paderborn University, Paderborn, Germany","[Dept. of Electr. Eng., Paderborn Univ., Germany]"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Paderborn University, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Paderborn Univ., Germany]","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076672029","display_name":"J\u00fcrgen Teich","orcid":"https://orcid.org/0000-0001-6285-5862"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Teich","raw_affiliation_strings":["Computer Science Department, Friedrich-Alexander-University, Nuremberg, Germany","[Computer Science Department, Friedrich-Alexander-University, Nuremberg, Germany]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Friedrich-Alexander-University, Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"[Computer Science Department, Friedrich-Alexander-University, Nuremberg, Germany]","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064569017"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":25.1083,"has_fulltext":false,"cited_by_count":644,"citation_normalized_percentile":{"value":0.99781921,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.8657764196395874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7448912858963013},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6465118527412415},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5882184505462646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5808671116828918},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5712894797325134},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5657078623771667},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49636703729629517},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.49378785490989685},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4914494752883911},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4589565396308899},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.44362562894821167},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4406476616859436},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.41865700483322144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2731146812438965}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8657764196395874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7448912858963013},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6465118527412415},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5882184505462646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5808671116828918},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5712894797325134},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5657078623771667},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49636703729629517},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.49378785490989685},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4914494752883911},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4589565396308899},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.44362562894821167},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4406476616859436},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.41865700483322144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2731146812438965},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sis.2003.1202243","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2003.1202243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W107299040","https://openalex.org/W1504943474","https://openalex.org/W1521316934","https://openalex.org/W1577668191","https://openalex.org/W1846834309","https://openalex.org/W2062015398","https://openalex.org/W2123808725","https://openalex.org/W2157601049","https://openalex.org/W2994964425","https://openalex.org/W4231132678","https://openalex.org/W4285719527","https://openalex.org/W6604396580","https://openalex.org/W6630172796","https://openalex.org/W6683477168","https://openalex.org/W6703967216","https://openalex.org/W6771627385"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2887485518","https://openalex.org/W1655912143","https://openalex.org/W2560221187","https://openalex.org/W4287021660","https://openalex.org/W2143668930"],"abstract_inverted_index":{"In":[0],"multi-objective":[1,112],"particle":[2,18,65],"swarm":[3],"optimization":[4],"(MOPSO)":[5],"methods,":[6],"selecting":[7],"the":[8,20,33,51,67,82,91,103,108],"best":[9,14,60],"local":[10,61,92],"guide":[11],"(the":[12],"global":[13],"particle)":[15],"for":[16,58,63,89,98],"each":[17,64],"of":[19,25,37,46,66,84,110],"population":[21],"from":[22],"a":[23,29,55,111],"set":[24],"Pareto-optimal":[26],"solutions":[27],"has":[28],"great":[30],"impact":[31],"on":[32],"convergence":[34],"and":[35,74,102],"diversity":[36],"solutions,":[38],"especially":[39],"when":[40],"optimizing":[41],"problems":[42],"with":[43,77,107],"high":[44],"number":[45],"objectives.":[47],"This":[48],"paper":[49],"introduces":[50],"Sigma":[52,70],"method":[53,57,71,88],"as":[54],"new":[56],"finding":[59,90],"guides":[62],"population.":[68],"The":[69],"is":[72,75],"implemented":[73],"compared":[76,106],"another":[78],"method,":[79],"which":[80],"uses":[81],"strategy":[83],"an":[85],"existing":[86],"MOPSO":[87],"guides.":[93],"These":[94],"methods":[95],"are":[96,105],"examined":[97],"different":[99],"test":[100],"functions":[101],"results":[104,109],"evolutionary":[113],"algorithm":[114],"(MOEA).":[115]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":20},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":25},{"year":2020,"cited_by_count":28},{"year":2019,"cited_by_count":25},{"year":2018,"cited_by_count":27},{"year":2017,"cited_by_count":37},{"year":2016,"cited_by_count":37},{"year":2015,"cited_by_count":40},{"year":2014,"cited_by_count":38},{"year":2013,"cited_by_count":47},{"year":2012,"cited_by_count":46}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}