{"id":"https://openalex.org/W2071131715","doi":"https://doi.org/10.1016/s0377-2217(01)00354-x","title":"Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks","display_name":"Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks","publication_year":2002,"publication_date":"2002-10-03","ids":{"openalex":"https://openalex.org/W2071131715","doi":"https://doi.org/10.1016/s0377-2217(01)00354-x","mag":"2071131715"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(01)00354-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(01)00354-x","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-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/A5081734540","display_name":"Cedric Davies","orcid":null},"institutions":[{"id":"https://openalex.org/I66890659","display_name":"Saint Mary's University","ror":"https://ror.org/010zh7098","country_code":"CA","type":"education","lineage":["https://openalex.org/I66890659"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Cedric Davies","raw_affiliation_strings":["Department of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","Dept. of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]},{"raw_affiliation_string":"Dept. of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028107284","display_name":"Pawan Lingras","orcid":"https://orcid.org/0000-0002-2149-7242"},"institutions":[{"id":"https://openalex.org/I66890659","display_name":"Saint Mary's University","ror":"https://ror.org/010zh7098","country_code":"CA","type":"education","lineage":["https://openalex.org/I66890659"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Pawan Lingras","raw_affiliation_strings":["Department of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","Dept. of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]},{"raw_affiliation_string":"Dept. of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028107284"],"corresponding_institution_ids":["https://openalex.org/I66890659"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":2.0224,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.87197109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"144","issue":"1","first_page":"27","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/computer-science","display_name":"Computer science","score":0.7590456008911133},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.708782970905304},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5828518867492676},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.5264090895652771},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49042508006095886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47619402408599854},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45731279253959656},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4349093735218048},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40741950273513794},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23503705859184265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16278862953186035},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.15990236401557922},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.13896071910858154},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13308408856391907},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11293920874595642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11227971315383911}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7590456008911133},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.708782970905304},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5828518867492676},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.5264090895652771},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49042508006095886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47619402408599854},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45731279253959656},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4349093735218048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40741950273513794},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23503705859184265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16278862953186035},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.15990236401557922},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.13896071910858154},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13308408856391907},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11293920874595642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11227971315383911}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(01)00354-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(01)00354-x","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:144:y:2003:i:1:p:27-38","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00354-X","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1488076966","https://openalex.org/W1497256448","https://openalex.org/W1591736593","https://openalex.org/W1987916269","https://openalex.org/W2007572995","https://openalex.org/W2030870864","https://openalex.org/W2035017516","https://openalex.org/W2062568266","https://openalex.org/W2089338760","https://openalex.org/W2119926658","https://openalex.org/W2131058166","https://openalex.org/W2144050074","https://openalex.org/W2151163048","https://openalex.org/W2169528473","https://openalex.org/W2914690612","https://openalex.org/W4399942150","https://openalex.org/W6678144642"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W2366342492"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}