{"id":"https://openalex.org/W3153490429","doi":"https://doi.org/10.1109/cec.2016.7744202","title":"A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem","display_name":"A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W3153490429","doi":"https://doi.org/10.1109/cec.2016.7744202","mag":"3153490429"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","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/A5020781131","display_name":"L\u00e1szl\u00f3 T. K\u00f3czy","orcid":"https://orcid.org/0000-0003-1316-4832"},"institutions":[{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]},{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Laszlo T. Koczy","raw_affiliation_strings":["Department of Information Technology Sz\u00e9chenyi Istv\u00e1n University Gy\u00f6r Hungary Department of Telecommunications and Media Informatics Budapest University of Technology and Economics, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology Sz\u00e9chenyi Istv\u00e1n University Gy\u00f6r Hungary Department of Telecommunications and Media Informatics Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I83579964","https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043012924","display_name":"P\u00e9ter F\u00f6ldesi","orcid":"https://orcid.org/0000-0003-3701-2913"},"institutions":[{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Peter Foldesi","raw_affiliation_strings":["Department of Logistics Sz\u00e9chenyi Istv\u00e1n University Gy\u00f6r Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Logistics Sz\u00e9chenyi Istv\u00e1n University Gy\u00f6r Hungary","institution_ids":["https://openalex.org/I83579964"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064382273","display_name":"Boldizs\u00e1r T\u00fc\u0171-Szab\u00f3","orcid":"https://orcid.org/0000-0003-3217-9204"},"institutions":[{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Boldizsar Tuu-Szabo","raw_affiliation_strings":["Department of Information Technology Sz\u00e9chenyi Istv\u00e1n University, Gy\u00f6r, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology Sz\u00e9chenyi Istv\u00e1n University, Gy\u00f6r, Hungary","institution_ids":["https://openalex.org/I83579964"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020781131"],"corresponding_institution_ids":["https://openalex.org/I29770179","https://openalex.org/I83579964"],"apc_list":null,"apc_paid":null,"fwci":5.5701,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.96239508,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3261","last_page":"3267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9962999820709229,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.989300012588501,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8640855550765991},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.8172844648361206},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.816840410232544},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6377153992652893},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6281298995018005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6267905235290527},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5841525793075562},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5531441569328308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5430968403816223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4815676212310791},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4749305844306946},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4378282129764557},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4298030436038971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3520281910896301}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8640855550765991},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8172844648361206},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.816840410232544},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6377153992652893},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6281298995018005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6267905235290527},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5841525793075562},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5531441569328308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5430968403816223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4815676212310791},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4749305844306946},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4378282129764557},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4298030436038971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3520281910896301},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W18216792","https://openalex.org/W98560305","https://openalex.org/W626292722","https://openalex.org/W1497256448","https://openalex.org/W1548562700","https://openalex.org/W1571087346","https://openalex.org/W1587411036","https://openalex.org/W1591939288","https://openalex.org/W1659842140","https://openalex.org/W1988676692","https://openalex.org/W1990212111","https://openalex.org/W2017708378","https://openalex.org/W2018660239","https://openalex.org/W2042986967","https://openalex.org/W2051321581","https://openalex.org/W2085185092","https://openalex.org/W2112077260","https://openalex.org/W2158458634","https://openalex.org/W2163428398","https://openalex.org/W2227719026","https://openalex.org/W2401610261","https://openalex.org/W2479792287","https://openalex.org/W2543580944","https://openalex.org/W4250503570","https://openalex.org/W6831607536"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W2804769572","https://openalex.org/W2244079844"],"abstract_inverted_index":{"This":[0,15],"paper":[1,43],"presents":[2],"a":[3],"Discrete":[4],"Bacterial":[5],"Memetic":[6],"Evolutionary":[7],"Algorithm":[8],"(DBMEA)":[9],"for":[10,131],"the":[11,18,70,74,81,85,99,105,108,113,118,123,132],"Traveling":[12],"Salesman":[13],"Problem.":[14],"algorithm":[16,23,83,121],"combines":[17],"very":[19],"efficient":[20,56],"bacterial":[21],"evolutionary":[22],"with":[24,54],"2-opt":[25],"and":[26,36,84,122,136],"3-opt":[27],"local":[28],"searches.":[29],"Our":[30],"approach":[31],"was":[32,77],"tested":[33],"on":[34],"TSPLIB":[35],"other":[37,55,137],"VLSI":[38],"benchmark":[39,72,109],"problems.":[40,140],"In":[41],"this":[42,89],"our":[44],"computational":[45],"results":[46],"(minimal":[47],"tour":[48,76],"lengths,":[49],"run":[50],"times)":[51],"are":[52],"compared":[53],"TSP":[57,135],"solver":[58],"algorithms":[59],"(Lin-Kernighan,":[60],"Concorde).":[61],"We":[62,103],"will":[63],"show":[64],"that":[65],"in":[66],"significant":[67],"number":[68],"of":[69,96,107,125,134],"published":[71],"problems":[73],"optimal":[75],"not":[78],"found":[79],"by":[80,98,112,117],"Concorde":[82],"Lin-Kernighan":[86],"heuristic":[87,127],"because":[88],"approaches":[90],"use":[91,124],"an":[92],"approximation":[93],"substituting":[94],"distances":[95],"points":[97],"closest":[100],"integer":[101],"values.":[102],"suggest":[104],"substitution":[106],"result":[110],"set":[111],"real":[114],"optima":[115],"calculated":[116],"new":[119],"DBMEA":[120,126],"as":[128],"more":[129],"precise":[130],"solution":[133],"NP-hard":[138],"optimization":[139]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}