{"id":"https://openalex.org/W4281878907","doi":"https://doi.org/10.1145/3529399.3529433","title":"Lehmer Encoding for Evolutionary Algorithms on Traveling Salesman Problem","display_name":"Lehmer Encoding for Evolutionary Algorithms on Traveling Salesman Problem","publication_year":2022,"publication_date":"2022-03-11","ids":{"openalex":"https://openalex.org/W4281878907","doi":"https://doi.org/10.1145/3529399.3529433"},"language":"en","primary_location":{"id":"doi:10.1145/3529399.3529433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3529399.3529433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Machine Learning Technologies (ICMLT)","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/A5058105327","display_name":"Vojt\u011bch Uher","orcid":"https://orcid.org/0000-0002-7475-3625"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Vojtech Uher","raw_affiliation_strings":["Department of Computer Science, VSB-Technical University of Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, VSB-Technical University of Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088934266","display_name":"Pavel Kr\u00f6mer","orcid":"https://orcid.org/0000-0001-8428-3332"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Kromer","raw_affiliation_strings":["Department of Computer Science, VSB-Technical University of Ostrava, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, VSB-Technical University of Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058105327"],"corresponding_institution_ids":["https://openalex.org/I142208455"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05083443,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"216","last_page":"222"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.998199999332428,"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.993399977684021,"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.8121997117996216},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6942022442817688},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6298459768295288},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.5958598256111145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.523697018623352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5019795894622803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48516517877578735},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4748806357383728},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.47054702043533325},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4604855477809906},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4571918547153473},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.44394904375076294},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4361093044281006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4229680001735687},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4205652177333832},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.41344499588012695},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1597365438938141}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8121997117996216},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6942022442817688},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6298459768295288},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.5958598256111145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.523697018623352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5019795894622803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48516517877578735},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4748806357383728},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.47054702043533325},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4604855477809906},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4571918547153473},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.44394904375076294},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4361093044281006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4229680001735687},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4205652177333832},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.41344499588012695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1597365438938141},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3529399.3529433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3529399.3529433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Machine Learning Technologies (ICMLT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W1879678483","https://openalex.org/W1970320473","https://openalex.org/W2008656089","https://openalex.org/W2010350947","https://openalex.org/W2029972294","https://openalex.org/W2051408140","https://openalex.org/W2152195021","https://openalex.org/W2163428398","https://openalex.org/W2165299997","https://openalex.org/W2167685483","https://openalex.org/W2168079536","https://openalex.org/W2310612427","https://openalex.org/W2317744239","https://openalex.org/W2614743655","https://openalex.org/W2725772765","https://openalex.org/W2752061190","https://openalex.org/W2938111495","https://openalex.org/W2966288920","https://openalex.org/W2970515102","https://openalex.org/W2986020234","https://openalex.org/W3013516278","https://openalex.org/W3040169523"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2946024655","https://openalex.org/W2758988501","https://openalex.org/W4246557197","https://openalex.org/W3013791021","https://openalex.org/W2146364482","https://openalex.org/W2099174039","https://openalex.org/W1604040598"],"abstract_inverted_index":{"The":[0,41,113],"traveling":[1],"salesman":[2],"problem":[3,43],"is":[4,12,44],"a":[5,38,50,85],"well-known":[6],"NP-hard":[7],"permutation":[8,58,87],"optimization":[9,27,36],"problem.":[10],"It":[11],"often":[13,121],"successfully":[14],"solved":[15],"by":[16],"nature-inspired":[17],"metaheuristics":[18,108],"such":[19],"as":[20,118],"differential":[21],"evolution":[22],"(DE)":[23],"and":[24,56,71,83,96,106],"particle":[25],"swarm":[26],"(PSO).":[28],"Both":[29,100],"algorithms":[30],"are":[31,102,115],"originally":[32],"designed":[33],"for":[34],"real-parameter":[35],"in":[37],"continuous":[39,53],"space.":[40,59],"crucial":[42],"an":[45],"appropriate":[46],"solution":[47],"representation":[48,88],"-":[49],"mapping":[51],"between":[52],"search":[54],"space":[55],"discrete":[57],"In":[60],"this":[61],"work,":[62],"we":[63],"study":[64],"the":[65,91,119,124,127],"popular":[66,110],"random":[67],"key":[68],"(RK)":[69],"encoding":[70,95],"its":[72,77,97],"properties.":[73],"We":[74],"point":[75],"out":[76],"typical":[78],"issues":[79],"(solution":[80],"redundancy,":[81],"sorting)":[82],"propose":[84],"novel":[86],"based":[89],"on":[90,109],"Lehmer":[92],"code":[93],"(LC)":[94],"factorial":[98],"representation.":[99],"encodings":[101],"tested":[103],"with":[104],"DE":[105],"PSO":[107],"TSP":[111],"instances.":[112],"results":[114],"very":[116],"promising":[117],"LC":[120],"significantly":[122],"overcomes":[123],"performance":[125],"of":[126],"RK.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}