{"id":"https://openalex.org/W2007287649","doi":"https://doi.org/10.1142/s1465876301000350","title":"A HYBRID GENETIC ALGORITHM \u2014 A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM","display_name":"A HYBRID GENETIC ALGORITHM \u2014 A NEW APPROACH TO SOLVE TRAVELING SALESMAN PROBLEM","publication_year":2001,"publication_date":"2001-06-01","ids":{"openalex":"https://openalex.org/W2007287649","doi":"https://doi.org/10.1142/s1465876301000350","mag":"2007287649"},"language":"en","primary_location":{"id":"doi:10.1142/s1465876301000350","doi":"https://doi.org/10.1142/s1465876301000350","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1465876301000350","pdf_url":null,"source":{"id":"https://openalex.org/S107240834","display_name":"International Journal of Computational Engineering Science","issn_l":"1465-8763","issn":["1465-8763","2047-6086"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Engineering Science","raw_type":"journal-article"},"volume":null,"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/A5040598642","display_name":"G. Andal Jayalakshmi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I21234101","display_name":"Thiagarajar College of Engineering","ror":"https://ror.org/01rgfv364","country_code":"IN","type":"education","lineage":["https://openalex.org/I21234101"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G. ANDAL JAYALAKSHMI","raw_affiliation_strings":["Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India","institution_ids":["https://openalex.org/I21234101"]}]},{"author_position":"middle","author":{"id":null,"display_name":"S. SATHIAMOORTHY","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I21234101","display_name":"Thiagarajar College of Engineering","ror":"https://ror.org/01rgfv364","country_code":"IN","type":"education","lineage":["https://openalex.org/I21234101"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. SATHIAMOORTHY","raw_affiliation_strings":["Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India","institution_ids":["https://openalex.org/I21234101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045157545","display_name":"Ramasamy Rajaram","orcid":"https://orcid.org/0000-0002-3112-7181","observed_orcids":["https://orcid.org/0000-0002-3112-7181"]},"institutions":[{"id":"https://openalex.org/I21234101","display_name":"Thiagarajar College of Engineering","ror":"https://ror.org/01rgfv364","country_code":"IN","type":"education","lineage":["https://openalex.org/I21234101"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. RAJARAM","raw_affiliation_strings":["Information Technology Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Technology Department, Thiagarajar College of Engineering, Madurai, Tamilnadu, India","institution_ids":["https://openalex.org/I21234101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21234101"],"apc_list":null,"apc_paid":null,"fwci":1.8617,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.8733037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"02","issue":"02","first_page":"339","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9672999978065491,"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.9672999978065491,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.03200000151991844,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9760000109672546},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"hybrid genetic algorithm","score":0.9959999918937683},{"id":"https://openalex.org/keywords/crossover-operator","display_name":"crossover operator","score":0.7149999737739563},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.7129999995231628},{"id":"https://openalex.org/keywords/euclidean-tsp","display_name":"Euclidean TSP","score":0.8289999961853027},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.640999972820282}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8293818235397339},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.60308837890625},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49997520446777344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4912413954734802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4856356680393219},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4798376262187958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45541927218437195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30753976106643677}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1465876301000350","doi":"https://doi.org/10.1142/s1465876301000350","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1465876301000350","pdf_url":null,"source":{"id":"https://openalex.org/S107240834","display_name":"International Journal of Computational Engineering Science","issn_l":"1465-8763","issn":["1465-8763","2047-6086"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Engineering Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.3692","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/~sathi/papers/IJCES.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1492008768","https://openalex.org/W1554451661","https://openalex.org/W1872445975","https://openalex.org/W2042704421","https://openalex.org/W2097571405","https://openalex.org/W2142183404","https://openalex.org/W2154929945","https://openalex.org/W2767274307","https://openalex.org/W4237954928"],"related_works":["https://openalex.org/W4387006055","https://openalex.org/W2557378401","https://openalex.org/W1964259034","https://openalex.org/W4404344031","https://openalex.org/W2746609","https://openalex.org/W2168830519","https://openalex.org/W183166194","https://openalex.org/W7096473099","https://openalex.org/W2012344939","https://openalex.org/W3081775163"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"three":[3],"new":[4],"heuristics":[5,16,31,70,93,128,153,192],"for":[6,72],"the":[7,15,25,69,81,119,124,135,143,204],"Euclidean":[8,26],"Traveling":[9],"Salesman":[10],"Problem":[11],"(TSP).":[12],"One":[13,67],"of":[14,41,58,68,115,126,173,190,213],"called":[17],"Initialization":[18],"Heuristics":[19],"(IH)":[20],"is":[21,71,193,198,207],"applicable":[22],"only":[23],"to":[24,38,80,95,102,200],"TSP,":[27],"while":[28],"other":[29,76],"two":[30,77,92],"RemoveSharp":[32],"and":[33,43,184,203],"LocalOpt":[34],"can":[35],"be":[36,201],"applied":[37,79,94],"all":[39],"forms":[40],"symmetric":[42],"asymmetric":[44],"TSPs.":[45],"A":[46],"Hybrid":[47,140],"Genetic":[48],"Algorithm":[49],"(HGA)":[50],"has":[51],"been":[52],"designed":[53],"by":[54,85,88,117,129,138,146],"combining":[55],"a":[56,210],"variant":[57],"an":[59],"already":[60],"existing":[61,147],"crossover":[62,86],"operator":[63],"with":[64,166,171],"these":[65,127,191],"heuristics.":[66],"generating":[73],"initial":[74],"population,":[75],"are":[78,97],"offspring":[82,96],"either":[83],"obtained":[84,137,145,208],"or":[87],"shuffling.":[89],"The":[90],"last":[91],"greedy":[98],"in":[99,149,158,209],"nature,":[100],"hence":[101],"prevent":[103],"getting":[104],"struck":[105],"up":[106],"at":[107],"local":[108],"optimum":[109],"we":[110],"have":[111],"included":[112],"proper":[113],"amount":[114],"randomness":[116],"using":[118],"shuffling":[120],"operator.":[121],"We":[122],"studied":[123],"effect":[125],"conducting":[130],"experiments,":[131],"which":[132],"show":[133],"that":[134],"results":[136,144,165],"our":[139],"GA":[141,148],"outperformed":[142],"certain":[150],"problems.":[151],"These":[152],"matched":[154],"\"Best":[155],"Known\"":[156],"solutions":[157],"most":[159],"cases.":[160],"In":[161],"others":[162],"it":[163],"produced":[164],"one%":[167],"tolerance,":[168],"when":[169],"compared":[170],"those":[172],"nature-inspired":[174],"algorithms":[175],"such":[176],"as":[177],"Simulated":[178],"Annealing":[179],"(SA),":[180],"Evolutionary":[181],"Computation":[182],"(EP)":[183],"Ant":[185],"Colony":[186],"System":[187],"(ACS).":[188],"Implementation":[189],"simple.":[194],"Our":[195],"convergence":[196],"rate":[197],"found":[199],"high":[202],"optimal":[205],"solution":[206],"fewer":[211],"number":[212],"iterations.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}