{"id":"https://openalex.org/W2004751620","doi":"https://doi.org/10.1109/dictap.2014.6821686","title":"An optimized genetic routing approach for constrained shortest path selections","display_name":"An optimized genetic routing approach for constrained shortest path selections","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2004751620","doi":"https://doi.org/10.1109/dictap.2014.6821686","mag":"2004751620"},"language":"en","primary_location":{"id":"doi:10.1109/dictap.2014.6821686","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821686","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","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/A5021990443","display_name":"Chatchai Poonriboon","orcid":null},"institutions":[{"id":"https://openalex.org/I179193067","display_name":"Khon Kaen University","ror":"https://ror.org/03cq4gr50","country_code":"TH","type":"education","lineage":["https://openalex.org/I179193067"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Chatchai Poonriboon","raw_affiliation_strings":["Department of Computer Science, Khon Kaen University, Muang, Khon Kaen, Thailand","Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Khon Kaen University, Muang, Khon Kaen, Thailand","institution_ids":["https://openalex.org/I179193067"]},{"raw_affiliation_string":"Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002","institution_ids":["https://openalex.org/I179193067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055624785","display_name":"Chakchai So\u2013In","orcid":"https://orcid.org/0000-0003-1026-191X"},"institutions":[{"id":"https://openalex.org/I179193067","display_name":"Khon Kaen University","ror":"https://ror.org/03cq4gr50","country_code":"TH","type":"education","lineage":["https://openalex.org/I179193067"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Chakchai So-In","raw_affiliation_strings":["Khon Kaen University, Khon Kaen, TH","Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Khon Kaen University, Khon Kaen, TH","institution_ids":["https://openalex.org/I179193067"]},{"raw_affiliation_string":"Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002","institution_ids":["https://openalex.org/I179193067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110338569","display_name":"Somjit Arch\u2010int","orcid":null},"institutions":[{"id":"https://openalex.org/I179193067","display_name":"Khon Kaen University","ror":"https://ror.org/03cq4gr50","country_code":"TH","type":"education","lineage":["https://openalex.org/I179193067"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Somjit Arch-Int","raw_affiliation_strings":["Khon Kaen University, Khon Kaen, TH","Logistic and Supply Chain (LSC) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Khon Kaen University, Khon Kaen, TH","institution_ids":["https://openalex.org/I179193067"]},{"raw_affiliation_string":"Logistic and Supply Chain (LSC) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002","institution_ids":["https://openalex.org/I179193067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044190787","display_name":"Kanokmon Rujirakul","orcid":"https://orcid.org/0000-0002-6972-0335"},"institutions":[{"id":"https://openalex.org/I179193067","display_name":"Khon Kaen University","ror":"https://ror.org/03cq4gr50","country_code":"TH","type":"education","lineage":["https://openalex.org/I179193067"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Kanokmon Rujirakul","raw_affiliation_strings":["Department of Computer Science, Khon Kaen University, Muang, Khon Kaen, Thailand","Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Khon Kaen University, Muang, Khon Kaen, Thailand","institution_ids":["https://openalex.org/I179193067"]},{"raw_affiliation_string":"Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, Thailand, 40002","institution_ids":["https://openalex.org/I179193067"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I179193067"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1379997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":null,"first_page":"226","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8358733654022217},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6822506785392761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.665087103843689},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6350767612457275},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6311082243919373},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6191398501396179},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5948328375816345},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5612763166427612},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5533233284950256},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5374420881271362},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5068610310554504},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5054752826690674},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.4720726013183594},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4570496380329132},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4143421947956085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1727353036403656},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16628316044807434},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.142526775598526},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09521716833114624}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8358733654022217},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6822506785392761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665087103843689},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6350767612457275},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6311082243919373},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6191398501396179},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5948328375816345},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5612763166427612},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5533233284950256},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5374420881271362},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5068610310554504},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5054752826690674},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.4720726013183594},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4570496380329132},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4143421947956085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1727353036403656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16628316044807434},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.142526775598526},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09521716833114624},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dictap.2014.6821686","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821686","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1979356488","https://openalex.org/W1982147649","https://openalex.org/W1995415305","https://openalex.org/W2006487034","https://openalex.org/W2022573578","https://openalex.org/W2029763098","https://openalex.org/W2031236641","https://openalex.org/W2037749870","https://openalex.org/W2044209627","https://openalex.org/W2064578828","https://openalex.org/W2071131715","https://openalex.org/W2094513248","https://openalex.org/W2097571405","https://openalex.org/W2103283316","https://openalex.org/W2111878713","https://openalex.org/W2117473144","https://openalex.org/W2133827964","https://openalex.org/W2143519380","https://openalex.org/W2465563035","https://openalex.org/W2487985730","https://openalex.org/W6677661624"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2388051136","https://openalex.org/W2364137215"],"abstract_inverted_index":{"This":[0],"paper":[1],"presented":[2],"a":[3,10,28,86],"new":[4],"methodology":[5],"to":[6],"determine":[7],"the":[8,70,74],"population,":[9],"set":[11],"of":[12,16,38,79,88],"feasible":[13],"paths,":[14],"chromosomes":[15],"genetic":[17],"algorithms":[18],"(GA)":[19],"given":[20,85],"multi-constraints,":[21],"i.e.,":[22],"distance,":[23],"deadline,":[24],"and":[25,31,43,51,64,81],"budget,":[26],"in":[27,69,73,77],"shortest":[29],"path":[30,52],"modified":[32],"vehicle":[33],"routing":[34],"problem.":[35],"Several":[36],"aspects":[37],"GA":[39,56],"have":[40],"been":[41],"explored":[42],"optimized":[44],"including":[45],"population":[46],"generation,":[47],"crossover,":[48],"mutation,":[49],"ranking,":[50],"selection":[53],"criteria.":[54],"Our":[55],"optimization":[57],"proposal":[58],"was":[59],"evaluated":[60],"with":[61,66],"benchmark":[62],"instances":[63],"compared":[65],"other":[67],"heuristics":[68],"literature":[71],"resulting":[72],"outstanding":[75],"performance":[76],"terms":[78],"quality":[80],"computational":[82],"time":[83],"complexity":[84],"heterogeneous":[87],"network":[89],"sizes.":[90]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}