{"id":"https://openalex.org/W2131113361","doi":"https://doi.org/10.1109/ijcnn.2011.6033402","title":"Solving Traveling Salesman Problem by a hybrid combination of PSO and Extremal Optimization","display_name":"Solving Traveling Salesman Problem by a hybrid combination of PSO and Extremal Optimization","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2131113361","doi":"https://doi.org/10.1109/ijcnn.2011.6033402","mag":"2131113361"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2011.6033402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2011.6033402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2011 International Joint Conference on Neural Networks","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/A5082481681","display_name":"Saeid Khakmardan","orcid":null},"institutions":[{"id":"https://openalex.org/I183859904","display_name":"Islamic Azad University, Mashhad","ror":"https://ror.org/00bvysh61","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I183859904"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"S. Khakmardan","raw_affiliation_strings":["Department of Artificial Intelligence, Islamic Azad University, Mashhad, Iran","Department of Artificial Intelligence, Mashhad Branch, Islamic Azad University, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Artificial Intelligence, Islamic Azad University, Mashhad, Iran","institution_ids":["https://openalex.org/I183859904"]},{"raw_affiliation_string":"Department of Artificial Intelligence, Mashhad Branch, Islamic Azad University, Iran","institution_ids":["https://openalex.org/I183859904"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002503154","display_name":"Hanieh Poostchi","orcid":"https://orcid.org/0000-0002-8725-2619"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Poostchi","raw_affiliation_strings":["Ferdowsi University of Mashhad, Mashhad, Iran","Ferdowsi University of Mashhad, IRAN"],"affiliations":[{"raw_affiliation_string":"Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]},{"raw_affiliation_string":"Ferdowsi University of Mashhad, IRAN","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026330809","display_name":"Mohammad-R. Akbarzadeh-T","orcid":"https://orcid.org/0000-0001-5626-5559"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M.-R. Akbarzadeh-T.","raw_affiliation_strings":["Center for Applied Research on Soft Computing and Intelligent Systems, Departments of Electrical Engineering and Computer Engineering, Ferdowsi University of Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Center for Applied Research on Soft Computing and Intelligent Systems, Departments of Electrical Engineering and Computer Engineering, Ferdowsi University of Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082481681"],"corresponding_institution_ids":["https://openalex.org/I183859904"],"apc_list":null,"apc_paid":null,"fwci":0.8552,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80469757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1501","last_page":"1507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9962999820709229,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"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.8912952542304993},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6779811978340149},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.658478856086731},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5942116379737854},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.577195405960083},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5290540456771851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49586138129234314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4055469036102295},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.1729595959186554}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8912952542304993},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6779811978340149},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.658478856086731},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5942116379737854},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.577195405960083},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5290540456771851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49586138129234314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4055469036102295},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.1729595959186554}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2011.6033402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2011.6033402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2011 International Joint Conference on Neural Networks","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":25,"referenced_works":["https://openalex.org/W1542123986","https://openalex.org/W1752423028","https://openalex.org/W1854284673","https://openalex.org/W1966977714","https://openalex.org/W1993358811","https://openalex.org/W1999459553","https://openalex.org/W2035529536","https://openalex.org/W2102409426","https://openalex.org/W2122560670","https://openalex.org/W2124558384","https://openalex.org/W2149523634","https://openalex.org/W2152195021","https://openalex.org/W2152951248","https://openalex.org/W2155050791","https://openalex.org/W2157226121","https://openalex.org/W2165719208","https://openalex.org/W2170123469","https://openalex.org/W2402846924","https://openalex.org/W2623885560","https://openalex.org/W2951367323","https://openalex.org/W3138355580","https://openalex.org/W6637824519","https://openalex.org/W6650155314","https://openalex.org/W6682329694","https://openalex.org/W6792741644"],"related_works":["https://openalex.org/W3001379520","https://openalex.org/W4224271060","https://openalex.org/W2308371765","https://openalex.org/W2005119019","https://openalex.org/W2149523634","https://openalex.org/W1879023378","https://openalex.org/W3164942530","https://openalex.org/W4200602616","https://openalex.org/W2367481616","https://openalex.org/W2140797420"],"abstract_inverted_index":{"Particle":[0],"Swarm":[1],"Optimization":[2,41],"(PSO)":[3],"has":[4,49],"received":[5],"great":[6],"attention":[7],"in":[8,84],"recent":[9],"years":[10],"as":[11,146],"a":[12,44,107,147],"successful":[13],"global":[14,104],"search":[15,46,97,105],"algorithm,":[16],"due":[17,91],"to":[18,36,52,92,140],"its":[19,103],"simple":[20],"implementation":[21],"and":[22,71,77,172,175],"inexpensive":[23],"computation":[24],"overhead.":[25],"However,":[26],"PSO":[27,61,70,100],"still":[28],"suffers":[29],"from":[30,65],"the":[31,66,72,79,85,93,99,117,123,127,141,156],"problem":[32,128],"of":[33,60,69,75,81,114,155],"early":[34,82],"convergence":[35],"locally":[37],"optimal":[38],"solutions.":[39],"Extremal":[40],"(EO)":[42],"is":[43,120,137,159],"local":[45,86,96],"algorithm":[47,133],"that":[48,111],"been":[50],"able":[51],"solve":[53],"NP":[54,148],"hard":[55,149],"optimization":[56,151],"problems.":[57],"The":[58,130,153],"combination":[59],"with":[62,161],"EO":[63],"benefits":[64],"exploration":[67],"ability":[68,74],"exploitation":[73],"EO,":[76],"reduces":[78],"probability":[80],"trapping":[83],"optima.":[87],"In":[88],"other":[89,163],"words,":[90],"EO's":[94],"strong":[95],"capability,":[98],"focuses":[101],"on":[102,166],"by":[106],"new":[108],"mutation":[109],"operator":[110],"prevents":[112],"loss":[113],"variety":[115],"among":[116],"particles.":[118],"This":[119],"done":[121],"when":[122],"particle's":[124],"parameters":[125],"exceed":[126],"conditions.":[129],"resulting":[131],"hybrid":[132],"Mutated":[134],"PSO-EO":[135],"(MPSO-EO)":[136],"then":[138],"applied":[139],"Traveling":[142],"Salesman":[143],"Problem":[144],"(TSP)":[145],"multimodal":[150,176],"problem.":[152],"performance":[154],"proposed":[157],"approach":[158],"compared":[160],"several":[162],"metaheuristic":[164],"methods":[165],"3":[167],"well":[168],"known":[169],"TSP":[170],"databases":[171],"10":[173],"unimodal":[174],"benchmark":[177],"functions.":[178]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"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"}