{"id":"https://openalex.org/W1986007359","doi":"https://doi.org/10.1080/01969720802492967","title":"COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS","display_name":"COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS","publication_year":2008,"publication_date":"2008-12-12","ids":{"openalex":"https://openalex.org/W1986007359","doi":"https://doi.org/10.1080/01969720802492967","mag":"1986007359"},"language":"en","primary_location":{"id":"doi:10.1080/01969720802492967","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969720802492967","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-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/A5040278918","display_name":"Malay Bhattacharyya","orcid":"https://orcid.org/0000-0001-7781-1264"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Malay Bhattacharyya","raw_affiliation_strings":["Machine Intelligence Unit, Indian Statistical Institute , Kolkata, India","[Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Machine Intelligence Unit, Indian Statistical Institute , Kolkata, India","institution_ids":["https://openalex.org/I6498739"]},{"raw_affiliation_string":"[Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India]","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089923787","display_name":"Anup Bandyopadhyay","orcid":"https://orcid.org/0000-0001-6215-8530"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anup Kumar Bandyopadhyay","raw_affiliation_strings":["Department of E.T.C.E. , Jadavpur University , Kolkata, India","Department of E. T. C.E., Jadavpur University, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Department of E.T.C.E. , Jadavpur University , Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Department of E. T. C.E., Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040278918"],"corresponding_institution_ids":["https://openalex.org/I6498739"],"apc_list":null,"apc_paid":null,"fwci":4.5764,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.94190611,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"1","first_page":"1","last_page":"24"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9316030740737915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6814117431640625},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6481590867042542},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6265116333961487},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6019290685653687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5912955403327942},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.4960502088069916},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4782394766807556},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.46346795558929443},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4473664462566376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2730082869529724},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.138028085231781}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9316030740737915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6814117431640625},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6481590867042542},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6265116333961487},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6019290685653687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5912955403327942},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.4960502088069916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4782394766807556},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.46346795558929443},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4473664462566376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2730082869529724},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.138028085231781},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01969720802492967","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969720802492967","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W68310584","https://openalex.org/W810261226","https://openalex.org/W1482722110","https://openalex.org/W1486199311","https://openalex.org/W1489417573","https://openalex.org/W1492417045","https://openalex.org/W1497256448","https://openalex.org/W1520111182","https://openalex.org/W2011039300","https://openalex.org/W2037455079","https://openalex.org/W2042986967","https://openalex.org/W2049287714","https://openalex.org/W2086863198","https://openalex.org/W2096590200","https://openalex.org/W2154929945","https://openalex.org/W2578503501","https://openalex.org/W3023540311","https://openalex.org/W3118260104","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W4308341320"],"related_works":["https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W2980689483","https://openalex.org/W2171568915","https://openalex.org/W1645834615","https://openalex.org/W2620231896","https://openalex.org/W3210931532","https://openalex.org/W87675801","https://openalex.org/W2191054341","https://openalex.org/W1992470106"],"abstract_inverted_index":{"Despite":[0],"the":[1,12,24,43,47,55,66,101,106,113],"existence":[2],"of":[3,6,8,26,42,57,77,115],"a":[4,36,75],"number":[5,76],"variations":[7],"genetic":[9,52,58],"algorithms":[10,59,117],"for":[11,46,83,93,105],"traveling":[13,48],"salesman":[14,49],"problem":[15,50],"in":[16,65],"literature,":[17],"no":[18],"efforts":[19],"have":[20,60],"been":[21,61,72,90],"made":[22],"to":[23,29],"best":[25,102],"our":[27],"knowledge":[28],"characterize":[30],"their":[31],"performance.":[32],"This":[33],"paper":[34],"presents":[35],"detailed":[37],"comparative":[38],"study":[39],"on":[40,100,119],"some":[41],"solution":[44,103],"methods":[45],"using":[51,74],"algorithms.":[53],"All":[54],"operators":[56],"given":[62],"equal":[63],"emphasis":[64],"analysis.":[67],"The":[68,96],"complete":[69],"simulation":[70],"has":[71,89],"done":[73],"C":[78],"programs":[79],"written":[80],"by":[81],"us":[82],"this":[84,94],"purpose.":[85],"A":[86],"permanent":[87],"network":[88,120],"particularly":[91],"considered":[92],"task.":[95],"results":[97],"shed":[98],"insight":[99],"method":[104],"problem.":[107],"However,":[108],"we":[109],"cannot":[110],"conclude":[111],"how":[112],"behavior":[114],"those":[116],"depends":[118],"topology.":[121]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"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"}