{"id":"https://openalex.org/W100708221","doi":null,"title":"An Evaluation of Potentials of Genetic Algorithm in Shortest Path Problem","display_name":"An Evaluation of Potentials of Genetic Algorithm in Shortest Path Problem","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W100708221","mag":"100708221"},"language":"en","primary_location":{"id":"mag:100708221","doi":null,"is_oa":false,"landing_page_url":"http://meetingorganizer.copernicus.org/EGU2009/EGU2009-8098.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306508951","display_name":"EGU General Assembly Conference Abstracts","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"EGU General Assembly Conference Abstracts","raw_type":null},"volume":null,"type":"conference-abstract","is_traditional":false,"indexed_in":[],"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/A5048606415","display_name":"S. Hassany Pazooky","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Hassany Pazooky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036830072","display_name":"Sh Rahmatollahi Namin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sh Rahmatollahi Namin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028136977","display_name":"Ali Soleymani","orcid":"https://orcid.org/0000-0002-1577-4370","observed_orcids":["https://orcid.org/0000-0002-1577-4370"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Soleymani","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1577-4370","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062957503","display_name":"Farhad Samadzadegan","orcid":"https://orcid.org/0000-0003-3439-5648","observed_orcids":["https://orcid.org/0000-0003-3439-5648"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farhad Samadzadegan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3439-5648","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8098","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8554999828338623,"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.8554999828338623,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09920000284910202,"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.015300000086426735,"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","display_name":"shortest path","score":0.9890000224113464},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9010000228881836},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.8759999871253967},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.9779999852180481},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.8539999723434448},{"id":"https://openalex.org/keywords/urban-road-networks","display_name":"urban road networks","score":0.5720000267028809},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.9150000214576721},{"id":"https://openalex.org/keywords/routing","display_name":"routing","score":0.4569999873638153},{"id":"https://openalex.org/keywords/evolutionary-algorithms","display_name":"evolutionary algorithms","score":0.6840000152587891},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.6290000081062317}],"concepts":[{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.8083944916725159},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7724943161010742},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7702080011367798},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7610936164855957},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7251054644584656},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6246209144592285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5349600911140442},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5252774953842163},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4780871570110321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45754334330558777},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.45013725757598877},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.42934316396713257},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41044700145721436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35974758863449097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18787476420402527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0852353572845459},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:100708221","doi":null,"is_oa":false,"landing_page_url":"http://meetingorganizer.copernicus.org/EGU2009/EGU2009-8098.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306508951","display_name":"EGU General Assembly Conference Abstracts","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"EGU General Assembly Conference Abstracts","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3128172354","https://openalex.org/W2352011009","https://openalex.org/W2942862556","https://openalex.org/W2386512129","https://openalex.org/W2043596689","https://openalex.org/W2349758986","https://openalex.org/W2977275967","https://openalex.org/W2390371152","https://openalex.org/W2980867369","https://openalex.org/W2583743745"],"abstract_inverted_index":{"One":[0],"of":[1,40,45,90,158,173,197,200,217],"the":[2,14,27,75,115,136,159,171,178,198,215,232],"most":[3,144],"typical":[4],"issues":[5],"considered":[6],"in":[7,10,34,42,71,113,155,165,207,220,230],"combinatorial":[8],"systems":[9],"transportation":[11,35,205],"networks,":[12,20],"is":[13,104,120,162,181],"shortest":[15,76,116,179,233],"path":[16,77,117,180],"problem.":[17,118],"In":[18,168],"such":[19,48],"routing":[21,41,54],"has":[22],"a":[23,107,132,151,185,204,227],"significant":[24],"impact":[25,39],"on":[26,203],"network\u2019s":[28],"performance.":[29,134],"Due":[30],"to":[31,59,65,73,126,214],"natural":[32],"complexity":[33],"networks":[36],"and":[37,52,92,101,161,190,194],"strong":[38],"different":[43,79],"fields":[44],"decision":[46],"making,":[47],"as":[49,106,143],"traffic":[50],"management":[51],"vehicle":[53],"problem":[55,62,216],"(VRP),":[56],"appropriate":[57],"solutions":[58,80],"solve":[60,74],"this":[61,169,188],"are":[63,81,85,99,141],"crucial":[64],"be":[66],"determined.":[67],"During":[68],"last":[69],"years,":[70],"order":[72],"problem,":[78],"proposed.":[82],"These":[83],"techniques":[84,202],"divided":[86],"into":[87],"two":[88],"categories":[89],"classic":[91,97,191,218],"evolutionary":[93,146],"approaches.":[94],"Two":[95],"well-known":[96],"algorithms":[98,140,192],"Dijkstra":[100,103],"A*.":[102],"known":[105],"robust,":[108],"but":[109,130],"time":[110],"consuming":[111],"algorithm":[112,123,175,189],"finding":[114,177,231],"A*":[119],"also":[121],"another":[122],"very":[124],"similar":[125],"Dijkstra,":[127],"less":[128],"robust":[129],"with":[131],"higher":[133],"On":[135],"other":[137],"hand,":[138],"Genetic":[139,148,174],"introduced":[142],"applicable":[145],"algorithms.":[147],"Algorithm":[149],"uses":[150],"parallel":[152],"search":[153,223],"method":[154],"several":[156],"parts":[157],"domain":[160],"not":[163],"trapped":[164],"local":[166],"optimums.":[167],"paper,":[170],"potentiality":[172],"for":[176],"evaluated":[182],"by":[183],"making":[184],"comparison":[186],"between":[187],"(Dijkstra":[193],"A*).":[195],"Evaluation":[196],"potential":[199],"these":[201],"network":[206],"an":[208],"urban":[209],"area":[210],"shows":[211],"that":[212],"due":[213],"methods":[219],"their":[221],"small":[222],"space,":[224],"GA":[225],"had":[226],"better":[228],"performance":[229],"path.":[234]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2016-06-24T00:00:00"}