{"id":"https://openalex.org/W2084107775","doi":"https://doi.org/10.1109/socpar.2010.5686165","title":"Using ants as a genetic crossover operator in GLS to solve STSP","display_name":"Using ants as a genetic crossover operator in GLS to solve STSP","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2084107775","doi":"https://doi.org/10.1109/socpar.2010.5686165","mag":"2084107775"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2010.5686165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5686165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","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/A5058715168","display_name":"Hassan Ismkhan","orcid":"https://orcid.org/0000-0002-8351-3770"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hassan Ismkhan","raw_affiliation_strings":["Computer Department, University of Isfahan, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"Computer Department, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069884960","display_name":"Kamran Zamanifar","orcid":"https://orcid.org/0000-0001-5417-0177"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Kamran Zamanifar","raw_affiliation_strings":["Computer Department, University of Isfahan, Isfahan, Iran"],"affiliations":[{"raw_affiliation_string":"Computer Department, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058715168"],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":0.9021,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80685572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"344","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9915000200271606,"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.9894000291824341,"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/crossover","display_name":"Crossover","score":0.9553894400596619},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9295741319656372},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.7750577926635742},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6601879596710205},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6407772302627563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.57345050573349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.56156986951828},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.41821929812431335},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37935930490493774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3016595244407654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27813175320625305},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06234419345855713}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9553894400596619},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9295741319656372},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.7750577926635742},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6601879596710205},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6407772302627563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.57345050573349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.56156986951828},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.41821929812431335},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37935930490493774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3016595244407654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27813175320625305},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06234419345855713},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2010.5686165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2010.5686165","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference of Soft Computing and Pattern Recognition","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":24,"referenced_works":["https://openalex.org/W147559675","https://openalex.org/W187767610","https://openalex.org/W1482722110","https://openalex.org/W1492008768","https://openalex.org/W1542631934","https://openalex.org/W1784970048","https://openalex.org/W1801849579","https://openalex.org/W1933569933","https://openalex.org/W1963987706","https://openalex.org/W2017766371","https://openalex.org/W2096648407","https://openalex.org/W2107631366","https://openalex.org/W2107941094","https://openalex.org/W2126939445","https://openalex.org/W2127691374","https://openalex.org/W2129006915","https://openalex.org/W2154929945","https://openalex.org/W2912569805","https://openalex.org/W6607571859","https://openalex.org/W6628973536","https://openalex.org/W6629363625","https://openalex.org/W6632295784","https://openalex.org/W6638228932","https://openalex.org/W6758375369"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W2153505252","https://openalex.org/W2084107775","https://openalex.org/W2114549389","https://openalex.org/W2777171873","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2369428395","https://openalex.org/W2981400081","https://openalex.org/W1997193297"],"abstract_inverted_index":{"Ant":[0],"Colony":[1],"Algorithm":[2],"(ACA)":[3],"and":[4],"Genetic":[5],"Local":[6],"Search":[7],"(GLS)":[8],"are":[9],"two":[10],"optimization":[11],"algorithms":[12],"that":[13,48],"have":[14],"been":[15],"successfully":[16],"applied":[17],"to":[18,39,52],"the":[19],"Traveling":[20],"Salesman":[21],"Problem":[22],"(TSP).":[23],"In":[24],"this":[25],"paper":[26],"we":[27],"define":[28],"new":[29],"crossover":[30,41],"operator":[31,42],"then":[32,43],"redefine":[33],"ACA's":[34],"ants":[35,51],"as":[36],"operate":[37],"according":[38],"defined":[40],"put":[44],"forward":[45],"our":[46],"GLS":[47],"uses":[49],"these":[50],"solve":[53],"Symmetric":[54],"TSP":[55],"(STSP)":[56],"instances.":[57]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}