{"id":"https://openalex.org/W4406242252","doi":"https://doi.org/10.1142/s1793005726500432","title":"A Novel Heuristic for the Generalized Traveling Salesman Problems with Imprecise Cost Matrices","display_name":"A Novel Heuristic for the Generalized Traveling Salesman Problems with Imprecise Cost Matrices","publication_year":2025,"publication_date":"2025-01-10","ids":{"openalex":"https://openalex.org/W4406242252","doi":"https://doi.org/10.1142/s1793005726500432"},"language":"en","primary_location":{"id":"doi:10.1142/s1793005726500432","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793005726500432","pdf_url":null,"source":{"id":"https://openalex.org/S135331755","display_name":"New Mathematics and Natural Computation","issn_l":"1793-0057","issn":["1793-0057","1793-7027"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"New Mathematics and Natural Computation","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/A5109533499","display_name":"Prasanta Dutta","orcid":"https://orcid.org/0000-0003-0347-4001"},"institutions":[{"id":"https://openalex.org/I28630478","display_name":"Kanya Maha Vidyalaya","ror":"https://ror.org/04svcpx91","country_code":"IN","type":"education","lineage":["https://openalex.org/I28630478"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prasanta Dutta","raw_affiliation_strings":["Department of Computer Science, Debra Thana S.K.S. Mahavidyalaya, 721124, Paschim-Medinipur, Tamluk, West Bengal, India"],"raw_orcid":"https://orcid.org/0000-0003-0347-4001","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Debra Thana S.K.S. Mahavidyalaya, 721124, Paschim-Medinipur, Tamluk, West Bengal, India","institution_ids":["https://openalex.org/I28630478"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027415998","display_name":"Indadul Khan","orcid":"https://orcid.org/0000-0002-4052-551X"},"institutions":[{"id":"https://openalex.org/I41549804","display_name":"Vidyasagar University","ror":"https://ror.org/027jsza11","country_code":"IN","type":"education","lineage":["https://openalex.org/I41549804"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Indadul Khan","raw_affiliation_strings":["Department of Computer Science, Chandrakona Vidyasagar Mahavidyalaya, 721201, Paschim-Medinipur, Medinipur, West Bengal, India"],"raw_orcid":"https://orcid.org/0000-0002-4052-551X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Chandrakona Vidyasagar Mahavidyalaya, 721201, Paschim-Medinipur, Medinipur, West Bengal, India","institution_ids":["https://openalex.org/I41549804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053436830","display_name":"Krishnendu Basuli","orcid":"https://orcid.org/0000-0002-5008-1844"},"institutions":[{"id":"https://openalex.org/I55862774","display_name":"West Bengal State University","ror":"https://ror.org/04qs5en05","country_code":"IN","type":"education","lineage":["https://openalex.org/I55862774"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishnendu Basuli","raw_affiliation_strings":["Department of Computer Science, West Bengal State University, Barasat, Kolkata 700126, West Bengal, India"],"raw_orcid":"https://orcid.org/0000-0002-5008-1844","affiliations":[{"raw_affiliation_string":"Department of Computer Science, West Bengal State University, Barasat, Kolkata 700126, West Bengal, India","institution_ids":["https://openalex.org/I55862774"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038738272","display_name":"Manas Kumar Maiti","orcid":"https://orcid.org/0009-0002-1033-578X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manas Kumar Maiti","raw_affiliation_strings":["Department of Mathematics, Mahishadal Raj College, Mahishadal 721628, Purba-Medinipur, West Bengal, India"],"raw_orcid":"https://orcid.org/0009-0002-1033-578X","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Mahishadal Raj College, Mahishadal 721628, Purba-Medinipur, West Bengal, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7127,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.88216895,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"22","issue":"03","first_page":"863","last_page":"892"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9585000276565552,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9585000276565552,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9384999871253967,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9269000291824341,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9053367376327515},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6912305355072021},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6839286684989929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.63962721824646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5537143349647522},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5425532460212708},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5176032781600952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3692269027233124}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9053367376327515},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6912305355072021},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6839286684989929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.63962721824646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5537143349647522},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5425532460212708},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5176032781600952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3692269027233124}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793005726500432","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793005726500432","pdf_url":null,"source":{"id":"https://openalex.org/S135331755","display_name":"New Mathematics and Natural Computation","issn_l":"1793-0057","issn":["1793-0057","1793-7027"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"New Mathematics and Natural Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W916916340","https://openalex.org/W1974379101","https://openalex.org/W1981294782","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2019741214","https://openalex.org/W2023947722","https://openalex.org/W2026012720","https://openalex.org/W2058572000","https://openalex.org/W2067061580","https://openalex.org/W2069759501","https://openalex.org/W2070484240","https://openalex.org/W2076539542","https://openalex.org/W2078066200","https://openalex.org/W2078538587","https://openalex.org/W2081231516","https://openalex.org/W2083562689","https://openalex.org/W2089196696","https://openalex.org/W2114159093","https://openalex.org/W2150367356","https://openalex.org/W2163428398","https://openalex.org/W2331132095","https://openalex.org/W2605821792","https://openalex.org/W2737797443","https://openalex.org/W2972510037","https://openalex.org/W3143971390","https://openalex.org/W3161970260","https://openalex.org/W3196187937","https://openalex.org/W4230588984","https://openalex.org/W4239991171"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2171568915","https://openalex.org/W2167244338","https://openalex.org/W4376138746","https://openalex.org/W1595757466","https://openalex.org/W2191054341","https://openalex.org/W2362402143","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W4396214731"],"abstract_inverted_index":{"A":[0],"meta-heuristic":[1],"approach":[2,21,71,269],"with":[3,179,212],"multiple":[4,310],"perturbation":[5],"rules":[6,90],"is":[7,29,44,61,72,113,134,257,300,328],"proposed":[8,20,132,268,326],"to":[9,49,74,115,127,177,247],"solve":[10],"the":[11,32,35,39,51,55,76,81,95,117,120,128,138,180,191,194,223,242,249,252,260,267,276,279,285,291,303,306,322,325,332],"generalized":[12],"traveling":[13],"salesman":[14],"problems":[15,229,240,295],"in":[16,38,140,162,169,225,230,251,274,334,339],"different":[17,98,145,183,200,236,282],"environments.":[18,166,227,255],"The":[19,26,131],"consists":[22],"of":[23,34,100,136,185,241,278,284,330],"two":[24],"phases.":[25],"first":[27,56],"phase":[28,41],"devoted":[30],"for":[31,84,93,160,182,222,281,289,313,342],"sequencing":[33],"groups":[36,99],"and":[37,119,164,171,187,244,263],"second":[40,82],"one":[42],"node":[43],"selected":[45],"from":[46,97,205,235,259,302,321],"each":[47],"group":[48,59,78,86,103,122,129],"minimize":[50],"tour":[52],"cost.":[53],"In":[54,80,190],"stage":[57],"a":[58,66,101,106,343],"sequence":[60,87],"generated":[62,234],"randomly.":[63],"After":[64],"that":[65,266,305,324],"[Formula:":[67,109],"see":[68,110],"text]-bit":[69],"shuffling":[70],"used":[73,92,114,246],"regenerate":[75],"new":[77],"sequences.":[79],"phase,":[83],"every":[85],"several":[88],"selection":[89],"are":[91,124,158,174,216,233,245],"selecting":[94],"nodes/cities":[96],"particular":[102],"sequence.":[104],"At":[105],"regular":[107],"interval,":[108],"text]-opt":[111],"operation":[112],"update":[116],"paths":[118,312],"corresponding":[121,253],"sequences":[123],"updated":[125],"according":[126],"elements.":[130],"algorithm":[133,195,250,280,307,327],"capable":[135,329],"solving":[137,331],"problem":[139,181],"crisp":[141,192,238,335],"as":[142,144,336,338],"well":[143,337],"imprecise":[146,226,231,254,340],"environments,":[147],"like":[148],"fuzzy":[149,163,170,186],"environment,":[150,152,193],"rough":[151,165,172,188],"etc.":[153],"Proper":[154],"decision":[155],"making":[156],"approaches":[157,168],"outlined":[159],"decision-making":[161],"Simulation":[167],"environments":[173,232,341],"also":[175],"presented":[176],"deal":[178],"types":[184],"estimations.":[189],"has":[196,308],"been":[197],"tested":[198],"using":[199],"sizes":[201,208],"benchmark":[202,218,237,293],"test":[203,239,248,294,315],"instances":[204],"GTSPLIB":[206,243],"having":[207],"upto":[209],"226":[210],"nodes":[211],"26":[213],"groups.":[214],"There":[215],"no":[217],"data":[219],"sets":[220],"available":[221],"GTSPs":[224,333],"Test":[228],"It":[256,317],"observed":[258],"numerical":[261],"illustration":[262],"graphical":[264],"representation":[265],"obtains":[270],"100%":[271],"accurate":[272],"results":[273],"all":[275,290],"runs":[277],"seeds":[283],"random":[286],"number":[287],"generator":[288],"considered":[292],"under":[296],"consideration.":[297],"Another":[298],"observation":[299],"visualized":[301],"table":[304],"found":[309],"optimal":[311],"some":[314],"instances.":[316],"can":[318],"be":[319],"concluded":[320],"observations":[323],"significantly":[344],"large":[345],"size":[346],"problems.":[347]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}