{"id":"https://openalex.org/W2106914949","doi":"https://doi.org/10.1109/cec.2004.1331068","title":"A new approach to the traveling salesman problem using genetic algorithms with priority encoding","display_name":"A new approach to the traveling salesman problem using genetic algorithms with priority encoding","publication_year":2005,"publication_date":"2005-01-17","ids":{"openalex":"https://openalex.org/W2106914949","doi":"https://doi.org/10.1109/cec.2004.1331068","mag":"2106914949"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1331068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/A5040193180","display_name":"Jyh-Da Wei","orcid":"https://orcid.org/0000-0003-2169-2408"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]},{"id":"https://openalex.org/I4210141710","display_name":"Institute of Statistical Science, Academia Sinica","ror":"https://ror.org/044gv5910","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210141710","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Jyh-Da Wei","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taiwan","Inst. of Inf. Sci., Acad. Sinica, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Inst. of Inf. Sci., Acad. Sinica, Taiwan","institution_ids":["https://openalex.org/I4210141710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100429197","display_name":"Dong-Hyun Lee","orcid":"https://orcid.org/0000-0002-1461-2556"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"D.T. Lee","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taiwan","Institute of Information Science; Academia Sinica; Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Institute of Information Science; Academia Sinica; Taiwan","institution_ids":["https://openalex.org/I4210098366"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040193180"],"corresponding_institution_ids":["https://openalex.org/I4210098366","https://openalex.org/I4210141710"],"apc_list":null,"apc_paid":null,"fwci":2.1937,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89185556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"220","issue":null,"first_page":"1457","last_page":"1464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8452157974243164},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.722970724105835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7139984369277954},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7087644338607788},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.7001777291297913},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6252365708351135},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6236014366149902},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5185849666595459},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4697478413581848},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4226815104484558},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34704941511154175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19684383273124695},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18909811973571777},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11229559779167175}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8452157974243164},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.722970724105835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7139984369277954},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7087644338607788},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.7001777291297913},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6252365708351135},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6236014366149902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5185849666595459},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4697478413581848},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4226815104484558},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34704941511154175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19684383273124695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18909811973571777},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11229559779167175},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2004.1331068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1331068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W66735260","https://openalex.org/W81055369","https://openalex.org/W1516301787","https://openalex.org/W1539770086","https://openalex.org/W1542631934","https://openalex.org/W1556283060","https://openalex.org/W1559839959","https://openalex.org/W1566652554","https://openalex.org/W1792608968","https://openalex.org/W1872445975","https://openalex.org/W1963987706","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2069024107","https://openalex.org/W2074228745","https://openalex.org/W2074950779","https://openalex.org/W2095546721","https://openalex.org/W2096648407","https://openalex.org/W2129006915","https://openalex.org/W2130137264","https://openalex.org/W2154929945","https://openalex.org/W2164866963","https://openalex.org/W2293414222","https://openalex.org/W2976664243","https://openalex.org/W3023540311","https://openalex.org/W4213121121","https://openalex.org/W4285719527","https://openalex.org/W6602672582","https://openalex.org/W6603304381","https://openalex.org/W6630838125","https://openalex.org/W6633332209","https://openalex.org/W6639245300"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W2980689483","https://openalex.org/W4376138746","https://openalex.org/W2189435634","https://openalex.org/W2592478754","https://openalex.org/W2055574289","https://openalex.org/W4301419164","https://openalex.org/W942307408","https://openalex.org/W2950637524"],"abstract_inverted_index":{"The":[0,76],"traveling":[1],"salesman":[2],"problem":[3],"is":[4],"difficult":[5],"to":[6,26,35,61,71,90],"solve":[7],"by":[8],"traditional":[9,37,92],"genetic":[10,38,93],"algorithms":[11],"because":[12],"of":[13,42],"the":[14,63,84],"requirement":[15],"that":[16],"each":[17],"node":[18],"must":[19],"be":[20],"visited":[21],"exactly":[22],"once.":[23],"In":[24],"response":[25],"this":[27],"critical":[28],"requirement,":[29],"many":[30],"researchers":[31],"used":[32],"specialized":[33],"operators":[34,44],"adapt":[36],"algorithms.":[39],"Although":[40],"some":[41],"these":[43],"are":[45,48],"useful,":[46],"they":[47],"ad":[49],"hoc.":[50],"We":[51,58],"propose":[52],"a":[53,68,73,80],"priority-based":[54],"encoding":[55,86],"scheme":[56],"instead.":[57],"assign":[59],"priorities":[60],"all":[62],"edges":[64],"and":[65,83,101],"then":[66],"perform":[67],"greedy":[69,77],"algorithm":[70,78],"find":[72],"suboptimal":[74],"solution.":[75],"constructs":[79],"legal":[81],"tour":[82],"priority":[85],"makes":[87],"it":[88],"possible":[89],"follow":[91],"evolution.":[94],"This":[95],"approach":[96],"retains":[97],"generality":[98],"in":[99],"applications":[100],"also":[102],"gains":[103],"remarkable":[104],"experimental":[105],"results.":[106]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}