{"id":"https://openalex.org/W2080809242","doi":"https://doi.org/10.1109/icnc.2010.5582429","title":"A genetic algorithm for multiobjective path optimisation problem","display_name":"A genetic algorithm for multiobjective path optimisation problem","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2080809242","doi":"https://doi.org/10.1109/icnc.2010.5582429","mag":"2080809242"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5582429","doi":"https://doi.org/10.1109/icnc.2010.5582429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582429","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"International Conference on Natural Computation (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5113613724","display_name":"Ching-Sheng Chiu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4880106","display_name":"Feng Chia University","ror":"https://ror.org/05vhczg54","country_code":"TW","type":"education","lineage":["https://openalex.org/I4880106"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ching-Sheng Chiu","raw_affiliation_strings":["Department of Urban Planning and Spatial Information, Feng Chia University FCU, Taichung, Taiwan","Department of Urban Planning and Spatial Information Feng Chia University, 100 Wenhwa Rd. Seatwen Taichung 40724 Taiwan ROC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Urban Planning and Spatial Information, Feng Chia University FCU, Taichung, Taiwan","institution_ids":["https://openalex.org/I4880106"]},{"raw_affiliation_string":"Department of Urban Planning and Spatial Information Feng Chia University, 100 Wenhwa Rd. Seatwen Taichung 40724 Taiwan ROC","institution_ids":["https://openalex.org/I4880106"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113613724"],"corresponding_institution_ids":["https://openalex.org/I4880106"],"apc_list":null,"apc_paid":null,"fwci":1.4131,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.88989716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2217","last_page":"2222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8109999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8109999895095825,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.05999999865889549,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.026799999177455902,"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/road-network","display_name":"road network","score":0.5540000200271606}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7019585371017456},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6826323866844177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6587579846382141},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6347330808639526},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.602908730506897},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5285179615020752},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46835440397262573},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42997226119041443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35763829946517944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20329371094703674},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17899289727210999},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1615045666694641},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1231263279914856},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11898607015609741},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5582429","doi":"https://doi.org/10.1109/icnc.2010.5582429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5582429","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"International Conference on Natural Computation (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5378999710083008}],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, justice, and strong institutions","score":0.6399999856948853}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W35369483","https://openalex.org/W119169328","https://openalex.org/W194786220","https://openalex.org/W1483431698","https://openalex.org/W1889956542","https://openalex.org/W1968500571","https://openalex.org/W1981565028","https://openalex.org/W1998132337","https://openalex.org/W2010327686","https://openalex.org/W2038091980","https://openalex.org/W2050590009","https://openalex.org/W2071852134","https://openalex.org/W2072208720","https://openalex.org/W2076542382","https://openalex.org/W2100586428","https://openalex.org/W2117473144","https://openalex.org/W2144329458","https://openalex.org/W2146879413","https://openalex.org/W2158773439","https://openalex.org/W2169528473","https://openalex.org/W2506768821"],"related_works":["https://openalex.org/W2584756475","https://openalex.org/W2112730008","https://openalex.org/W2376169310","https://openalex.org/W4403156594","https://openalex.org/W2383051819","https://openalex.org/W2229264235","https://openalex.org/W3162763213","https://openalex.org/W2379951682","https://openalex.org/W2016968120","https://openalex.org/W7095259777"],"abstract_inverted_index":{"The":[0,139],"conventional":[1,158],"information":[2,155],"used":[3],"to":[4,36,60,67,204],"guide":[5],"drivers":[6,115,150],"in":[7,113,116,187],"selecting":[8],"their":[9],"driving":[10],"paths":[11,173],"is":[12,21],"the":[13,43,62,86,107,110,143,146,157,166,169,171,175,185,194],"shortest-distance":[14],"path":[15,19,32,48,52,96,117],"(SDP).":[16],"However,":[17],"driver":[18,47],"selection":[20],"a":[22,30,38,90,95,189],"multiple":[23],"criteria":[24],"decision":[25],"process.":[26],"This":[27],"paper":[28],"presents":[29],"multiobjective":[31],"optimisation":[33,53],"(MOPO)":[34],"model":[35,112,148],"make":[37],"more":[39,151],"precise":[40],"simulation":[41],"of":[42,46,79,109,135,168,174,191],"decision-making":[44],"behaviour":[45],"selection.":[49],"Three":[50],"single-objective":[51],"(SOPO)":[54],"models":[55],"were":[56,103,122],"taken":[57],"into":[58],"account":[59],"establish":[61],"MOPO":[63,88,111,147,176],"model.":[64],"They":[65],"relate":[66],"cumulative":[68],"distance":[69],"(shortest-distance":[70],"path),":[71],"passed":[72],"intersections":[73],"(least-node":[74],"path,":[75,82],"LNP)":[76],"and":[77,100,133,137,153,177,202],"number":[78],"turns":[80],"(minimum-turn":[81],"MTP).":[83],"To":[84,105],"solve":[85,205],"proposed":[87],"problem,":[89],"two-stage":[91],"technique":[92],"which":[93],"incorporates":[94],"genetic":[97],"algorithm":[98],"(PGA)":[99],"weight-sum":[101],"method":[102],"developed.":[104],"demonstrate":[106,142],"advantages":[108],"assisting":[114],"selection,":[118],"several":[119],"empirical":[120],"studies":[121],"conducted":[123],"using":[124],"two":[125],"real":[126],"road":[127],"networks":[128],"with":[129,165],"different":[130],"roadway":[131],"types":[132],"numbers":[134],"nodes":[136],"links.":[138],"experimental":[140],"results":[141],"advantage":[144],"that":[145,164,196],"provides":[149],"diverse":[152],"richer":[154],"than":[156],"SDP.":[159],"It":[160],"can":[161,180],"be":[162,181],"concluded":[163],"aids":[167],"GIS,":[170],"optimal":[172],"SOPO":[178],"problems":[179,198],"easily":[182],"identified":[183],"by":[184],"PGA":[186],"just":[188],"matter":[190],"seconds,":[192],"despite":[193],"fact":[195],"these":[197],"are":[199],"highly":[200],"complex":[201],"difficult":[203],"manually.":[206]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}