{"id":"https://openalex.org/W2019053424","doi":"https://doi.org/10.1109/icnc.2011.6022171","title":"Improved particle swarm optimization for multi-object Traveling Salesman Problems","display_name":"Improved particle swarm optimization for multi-object Traveling Salesman Problems","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2019053424","doi":"https://doi.org/10.1109/icnc.2011.6022171","mag":"2019053424"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2011.6022171","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022171","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","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/A5010260984","display_name":"Jinrong Su","orcid":"https://orcid.org/0000-0001-7663-8826"},"institutions":[{"id":"https://openalex.org/I181877577","display_name":"Shanxi University","ror":"https://ror.org/03y3e3s17","country_code":"CN","type":"education","lineage":["https://openalex.org/I181877577"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jin-rong Su","raw_affiliation_strings":["Department of information Business, College of Shan Xi University Tai Yuan, China","Department of information, Business College of Shan Xi University, Tai Yuan, China"],"affiliations":[{"raw_affiliation_string":"Department of information Business, College of Shan Xi University Tai Yuan, China","institution_ids":[]},{"raw_affiliation_string":"Department of information, Business College of Shan Xi University, Tai Yuan, China","institution_ids":["https://openalex.org/I181877577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010260984"],"corresponding_institution_ids":["https://openalex.org/I181877577"],"apc_list":null,"apc_paid":null,"fwci":0.8552,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79006563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":null,"first_page":"1175","last_page":"1179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7339009046554565},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7037763595581055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6817834377288818},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6667146682739258},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6473910212516785},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5932864546775818},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5712051391601562},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5450102090835571},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5158883333206177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.508735716342926},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4771525263786316},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4697228968143463},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.46486836671829224},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4451248347759247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43505775928497314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3287907838821411},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14483517408370972}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7339009046554565},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7037763595581055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6817834377288818},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6667146682739258},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6473910212516785},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5932864546775818},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5712051391601562},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5450102090835571},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5158883333206177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.508735716342926},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4771525263786316},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4697228968143463},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.46486836671829224},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4451248347759247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43505775928497314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3287907838821411},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14483517408370972},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2011.6022171","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2011.6022171","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Seventh International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1561764088","https://openalex.org/W2003085167","https://openalex.org/W2106334424","https://openalex.org/W2109364787","https://openalex.org/W2116850883","https://openalex.org/W2149523634","https://openalex.org/W2358949830","https://openalex.org/W2362700460","https://openalex.org/W2364992310","https://openalex.org/W2378650588","https://openalex.org/W2543580944","https://openalex.org/W3149829615","https://openalex.org/W4252955856","https://openalex.org/W4386336504"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2189435634","https://openalex.org/W2592478754","https://openalex.org/W2055574289","https://openalex.org/W4301419164","https://openalex.org/W942307408","https://openalex.org/W2950637524"],"abstract_inverted_index":{"An":[0],"improved":[1],"particle":[2,24],"swarm":[3],"optimization":[4],"algorithm":[5,12,20,40,48,61,79],"is":[6,49],"proposed":[7],"in":[8,38,70],"this":[9,60,93],"paper.":[10],"The":[11,47,74],"draws":[13],"on":[14],"the":[15,18,23,44,78],"thinking":[16],"of":[17,66],"greedy":[19],"to":[21,30,51,62],"initialize":[22],"swarm.":[25],"Two":[26],"swarms":[27],"are":[28,41,90],"used":[29,50],"optimize":[31],"synchronously,":[32],"and":[33,35,84],"crossover":[34],"mutation":[36],"operators":[37],"genetic":[39],"introduced":[42],"into":[43],"new":[45],"algorithm.":[46,94],"solve":[52,63],"multi-object":[53,64],"Traveling":[54],"Salesman":[55],"Problem.":[56],"We":[57],"also":[58],"use":[59],"TSP":[65],"ten":[67],"scattered":[68],"attractions":[69],"Shan":[71],"Xi":[72],"Province.":[73],"results":[75],"show":[76],"that":[77],"has":[80],"high":[81],"convergence":[82,85],"speed":[83],"ratio.":[86],"More":[87],"Pareto":[88],"optimal":[89],"found":[91],"with":[92]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}