{"id":"https://openalex.org/W4413209214","doi":"https://doi.org/10.1145/3712255.3726778","title":"Local Search Integrated Genetic Algorithms for Solving the Colored Traveling Salesman Problem","display_name":"Local Search Integrated Genetic Algorithms for Solving the Colored Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-07-14","ids":{"openalex":"https://openalex.org/W4413209214","doi":"https://doi.org/10.1145/3712255.3726778"},"language":"en","primary_location":{"id":"doi:10.1145/3712255.3726778","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726778","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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/A5025970994","display_name":"Karuna Panwar","orcid":null},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Karuna Panwar","raw_affiliation_strings":["Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India"],"raw_orcid":"https://orcid.org/0009-0003-4065-7090","affiliations":[{"raw_affiliation_string":"Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India","institution_ids":["https://openalex.org/I154851008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021797294","display_name":"Kusum Deep","orcid":"https://orcid.org/0000-0001-5821-2696"},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kusum Deep","raw_affiliation_strings":["Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India"],"raw_orcid":"https://orcid.org/0000-0001-5821-2696","affiliations":[{"raw_affiliation_string":"Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India","institution_ids":["https://openalex.org/I154851008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025970994"],"corresponding_institution_ids":["https://openalex.org/I154851008"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34983952,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"531","last_page":"534"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9958999752998352,"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.9958999752998352,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9943000078201294,"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.8374332189559937},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.7184528112411499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6290985941886902},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5524798035621643},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5114856958389282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4925471246242523},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38575130701065063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23681536316871643},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14545193314552307}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8374332189559937},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.7184528112411499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6290985941886902},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5524798035621643},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5114856958389282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4925471246242523},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38575130701065063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23681536316871643},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14545193314552307},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3712255.3726778","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726778","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":10,"referenced_works":["https://openalex.org/W1668929251","https://openalex.org/W2061594663","https://openalex.org/W2314579004","https://openalex.org/W2582693844","https://openalex.org/W2626431333","https://openalex.org/W2754470934","https://openalex.org/W2802427737","https://openalex.org/W3161243347","https://openalex.org/W3176609373","https://openalex.org/W4214813201"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2356976268","https://openalex.org/W2495211334"],"abstract_inverted_index":{"The":[0,27,90,111],"Colored":[1],"Traveling":[2,12],"Salesman":[3,13],"Problem":[4,14],"(CTSP)":[5],"is":[6,95,137],"a":[7,58,69],"generalization":[8],"of":[9,92],"the":[10,45,116,121,142],"Multiple":[11],"(MTSP),":[15],"wherein":[16],"multiple":[17],"salesmen":[18],"are":[19],"allowed":[20],"to":[21,54],"visit":[22],"cities":[23],"with":[24,62,106,135],"specific":[25],"restrictions.":[26],"CTSP":[28,56,102],"introduces":[29],"numerous":[30],"constraints,":[31],"making":[32],"it":[33],"complex":[34],"and":[35,73,86,100,104,125,145],"computationally":[36],"challenging":[37],"for":[38,109],"conventional":[39],"optimization":[40],"techniques.":[41,89],"This":[42],"work":[43],"advances":[44],"field":[46],"by":[47,68,77],"introducing":[48],"four":[49],"Genetic":[50],"Algorithms":[51],"(GAs)":[52],"designed":[53],"solve":[55],"efficiently:":[57],"basic":[59],"GA,":[60],"GA":[61,66,134],"greedy":[63],"initialization":[64],"(GAG),":[65],"enhanced":[67,76],"2-opt":[70,117,136],"local":[71],"search,":[72],"GAG":[74],"also":[75],"2-opt.":[78],"These":[79],"algorithms":[80],"employ":[81],"tournament":[82],"selection,":[83],"city":[84,87],"crossover,":[85],"mutation":[88],"performance":[91],"these":[93],"approaches":[94],"evaluated":[96],"on":[97],"20":[98],"small-":[99],"medium-scale":[101],"instances":[103],"compared":[105],"existing":[107],"GAs":[108],"CTSP.":[110],"results":[112],"show":[113],"that":[114],"integrating":[115],"algorithm":[118],"significantly":[119],"enhances":[120],"balance":[122],"between":[123],"exploration":[124],"exploitation":[126],"in":[127],"GAs,":[128],"improving":[129],"solution":[130,143],"accuracy.":[131],"Among":[132],"them,":[133],"particularly":[138],"effective,":[139],"optimizing":[140],"both":[141],"quality":[144],"computational":[146],"efficiency.":[147]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}