{"id":"https://openalex.org/W2104098057","doi":"https://doi.org/10.1109/cec.2007.4425094","title":"A hybrid evolutionary algorithm for dynamic route planning","display_name":"A hybrid evolutionary algorithm for dynamic route planning","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2104098057","doi":"https://doi.org/10.1109/cec.2007.4425094","mag":"2104098057"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2007.4425094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4425094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"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/A5043731721","display_name":"Lai Wei Lup","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Lai Wei Lup","raw_affiliation_strings":["Department of Electrical & Computer Engineering, National University of Singapore, Singapore","Nat. Univ. of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Nat. Univ. of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016960268","display_name":"Dipti Srinivasan","orcid":"https://orcid.org/0000-0003-4877-3478"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Dipti Srinivasan","raw_affiliation_strings":["Department of Electrical & Computer Engineering, National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4743","last_page":"4749"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"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.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6612515449523926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6592517495155334},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.6584874391555786},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6060331463813782},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.586109459400177},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.540047287940979},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5242350697517395},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5137299299240112},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5040637254714966},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4909225106239319},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40578028559684753},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3782484829425812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1695205271244049},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16020548343658447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15795210003852844},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13765272498130798},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09239441156387329},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08244344592094421}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6612515449523926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6592517495155334},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.6584874391555786},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6060331463813782},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.586109459400177},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.540047287940979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5242350697517395},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5137299299240112},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5040637254714966},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4909225106239319},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40578028559684753},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3782484829425812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1695205271244049},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16020548343658447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15795210003852844},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13765272498130798},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09239441156387329},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08244344592094421},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2007.4425094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2007.4425094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/68839","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/68839","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1597629685","https://openalex.org/W2107941094","https://openalex.org/W2113342577","https://openalex.org/W2117473144","https://openalex.org/W2124613591","https://openalex.org/W2139798690","https://openalex.org/W6635903169","https://openalex.org/W6678593581"],"related_works":["https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2377010080","https://openalex.org/W3013845525","https://openalex.org/W2601521963","https://openalex.org/W2354782517","https://openalex.org/W2372342312","https://openalex.org/W2058348659","https://openalex.org/W1978978926"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"a":[3,13,16,21,112,118,125,151,169],"dynamic":[4,53,191],"route":[5,14,28,54,77],"planning":[6,29,55],"problem":[7],"(DRPP)":[8],"involving":[9],"the":[10,36,44,62,66,72,86,93,139,144,157,178,181,190,194],"optimization":[11,165],"of":[12,35,104,180,193],"for":[15,52,65,91],"single":[17],"vehicle":[18],"traveling":[19],"between":[20],"given":[22,25],"source":[23],"and":[24,117,130,135,160,172],"destination.":[26],"Although":[27],"has":[30],"been":[31],"widely":[32],"studied,":[33],"most":[34],"available":[37],"applications":[38],"are":[39],"primarily":[40],"targeted":[41],"at":[42],"finding":[43],"shortest":[45,74],"path":[46],"(SP)":[47],"routes,":[48],"which":[49],"is":[50,99,147,166,184],"insufficient":[51],"in":[56],"real":[57],"life":[58],"scenario.":[59],"For":[60],"example,":[61],"travel":[63],"time":[64,75],"SP":[67,134,164],"may":[68],"not":[69],"correspond":[70],"to":[71,79,101,138,186,189],"overall":[73],"(ST)":[76],"due":[78],"varying":[80],"road":[81],"conditions.":[82],"In":[83,141],"this":[84,106,142],"paper,":[85,143],"proposed":[87,109,145,182],"Hybrid":[88],"Evolutionary":[89],"Algorithm":[90,121,127],"solving":[92,105],"Dynamic":[94],"Route":[95],"Planning":[96],"Problem":[97],"(HEADRPP)":[98],"believed":[100],"be":[102,187],"capable":[103],"problem.":[107],"The":[108],"HEADRPP":[110,146,183],"comprises":[111],"Fuzzy":[113],"Logic":[114],"Implementation":[115],"(FLI)":[116],"Graph":[119],"Partitioning":[120],"(GPA)":[122],"incorporated":[123],"into":[124],"Genetic":[126],"(GA)":[128],"core,":[129],"offers":[131],"both":[132],"optimized":[133],"ST":[136],"routes":[137],"user.":[140],"successfully":[148],"tested":[149],"on":[150,163],"138":[152],"node":[153],"network":[154],"extracted":[155],"from":[156],"Singapore":[158],"Map,":[159],"its":[161],"performance":[162,179],"compared":[167],"with":[168],"pure":[170],"GA":[171],"an":[173],"ant":[174],"based":[175],"algorithm.":[176],"Overall":[177],"shown":[185],"robust":[188],"nature":[192],"DRPP.":[195]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}