{"id":"https://openalex.org/W7125023470","doi":"https://doi.org/10.1109/cvmi66673.2025.11337504","title":"Benchmarking Improved Metaphor-Less Optimization Algorithms on Traveling Salesman Problem","display_name":"Benchmarking Improved Metaphor-Less Optimization Algorithms on Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-10-12","ids":{"openalex":"https://openalex.org/W7125023470","doi":"https://doi.org/10.1109/cvmi66673.2025.11337504"},"language":null,"primary_location":{"id":"doi:10.1109/cvmi66673.2025.11337504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvmi66673.2025.11337504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Computer Vision and Machine Intelligence (CVMI)","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/A5123438112","display_name":"Arun Bhattacharya","orcid":null},"institutions":[{"id":"https://openalex.org/I67357951","display_name":"KIIT University","ror":"https://ror.org/00k8zt527","country_code":"IN","type":"education","lineage":["https://openalex.org/I67357951"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arun Bhattacharya","raw_affiliation_strings":["School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha"],"raw_orcid":"https://orcid.org/0009-0005-6479-8159","affiliations":[{"raw_affiliation_string":"School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha","institution_ids":["https://openalex.org/I67357951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119281339","display_name":"Dastageer Siddiqui","orcid":null},"institutions":[{"id":"https://openalex.org/I67357951","display_name":"KIIT University","ror":"https://ror.org/00k8zt527","country_code":"IN","type":"education","lineage":["https://openalex.org/I67357951"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dastageer Siddiqui","raw_affiliation_strings":["School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha"],"raw_orcid":"https://orcid.org/0009-0003-5708-1948","affiliations":[{"raw_affiliation_string":"School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha","institution_ids":["https://openalex.org/I67357951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069085396","display_name":"Partha Pratim Sarangi","orcid":"https://orcid.org/0000-0002-5628-997X"},"institutions":[{"id":"https://openalex.org/I67357951","display_name":"KIIT University","ror":"https://ror.org/00k8zt527","country_code":"IN","type":"education","lineage":["https://openalex.org/I67357951"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Partha Pratim Sarangi","raw_affiliation_strings":["School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha"],"raw_orcid":"https://orcid.org/0000-0002-5628-997X","affiliations":[{"raw_affiliation_string":"School of Computer Engineering, KIIT Deemed to be University,Bhubaneswar,Odisha","institution_ids":["https://openalex.org/I67357951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9045,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83264722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.45419999957084656,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.45419999957084656,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.42340001463890076,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.021800000220537186,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/benchmarking","display_name":"Benchmarking","score":0.7081999778747559},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7008000016212463},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6622999906539917},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6607999801635742},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5672000050544739},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5108000040054321},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.42080000042915344},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.40529999136924744},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3928999900817871}],"concepts":[{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.7081999778747559},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7008000016212463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.666700005531311},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6622999906539917},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6607999801635742},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5672000050544739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5444999933242798},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5108000040054321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4706000089645386},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.42080000042915344},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.374099999666214},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.36000001430511475},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.3546000123023987},{"id":"https://openalex.org/C192122231","wikidata":"https://www.wikidata.org/wiki/Q4680754","display_name":"Adaptive mutation","level":3,"score":0.33230000734329224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32839998602867126},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.26809999346733093},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2651999890804291},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.25119999051094055},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvmi66673.2025.11337504","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvmi66673.2025.11337504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Computer Vision and Machine Intelligence (CVMI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6902741193771362,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W2032982318","https://openalex.org/W2043325537","https://openalex.org/W2104635975","https://openalex.org/W2163428398","https://openalex.org/W2239574596","https://openalex.org/W3082119399","https://openalex.org/W3154719286","https://openalex.org/W3156852085","https://openalex.org/W3164172623","https://openalex.org/W3168798875","https://openalex.org/W3181424446","https://openalex.org/W3212179065","https://openalex.org/W4207008679","https://openalex.org/W4383704099","https://openalex.org/W4388294626","https://openalex.org/W4391900868","https://openalex.org/W4401702711","https://openalex.org/W4401852868","https://openalex.org/W4406403961","https://openalex.org/W4410257816"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,17],"benchmarking":[4],"study":[5,52],"of":[6,73,89],"metaphor-less":[7,30],"metaheuristic":[8],"algorithms":[9,31,75],"for":[10],"solving":[11],"the":[12],"Traveling":[13],"Salesman":[14],"Problem":[15],"(TSP),":[16],"classic":[18],"NP-hard":[19],"combinatorial":[20],"optimization":[21,63],"task.":[22],"Unlike":[23],"conventional":[24],"metaheuristics":[25],"inspired":[26],"by":[27],"natural":[28],"metaphors,":[29],"focus":[32],"purely":[33],"on":[34,44,64],"mathematical":[35],"operators":[36],"to":[37],"balance":[38],"exploration":[39],"and":[40,61,82,95,103,116],"exploitation":[41],"without":[42],"reliance":[43],"analogies":[45],"or":[46],"algorithm":[47],"specific":[48],"control":[49],"parameters.":[50],"The":[51],"evaluates":[53],"eight":[54],"such":[55],"algorithms-including":[56],"BMR,":[57],"BWR,":[58,104],"Rao-1/2/3,":[59],"Jaya,":[60],"Runge-Kutta":[62],"benchmark":[65],"TSP":[66],"instances":[67],"from":[68],"TSPLIB.":[69],"Additionally,":[70],"improved":[71],"versions":[72],"these":[74],"using":[76],"adaptive":[77],"mutation":[78,108],"strategies":[79],"are":[80],"proposed":[81],"analyzed.":[83],"Performance":[84],"is":[85],"measured":[86],"in":[87,114],"terms":[88],"solution":[90],"quality,":[91],"convergence":[92,117],"rate,":[93],"stability,":[94],"resource":[96],"efficiency.":[97],"Experimental":[98],"results":[99],"demonstrate":[100],"that":[101],"BMR":[102],"especially":[105],"with":[106],"enhanced":[107],"(EM),":[109],"consistently":[110],"outperform":[111],"other":[112],"methods":[113],"accuracy":[115],"while":[118],"maintaining":[119],"low":[120],"computational":[121],"overhead.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-21T00:00:00"}