{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:14:07Z","timestamp":1772820847118,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0377-2217(01)00354-x","type":"journal-article","created":{"date-parts":[[2002,10,3]],"date-time":"2002-10-03T20:16:26Z","timestamp":1033676186000},"page":"27-38","source":"Crossref","is-referenced-by-count":55,"title":["Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks"],"prefix":"10.1016","volume":"144","author":[{"given":"Cedric","family":"Davies","sequence":"first","affiliation":[]},{"given":"Pawan","family":"Lingras","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00354-X_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two papers in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numeriske Mathematics"},{"issue":"2","key":"10.1016\/S0377-2217(01)00354-X_BIB2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest paths","volume":"5","author":"Floyd","year":"1962","journal-title":"Communications of the ACM"},{"issue":"3","key":"10.1016\/S0377-2217(01)00354-X_BIB4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H","article-title":"Time-varying shortest path problems with constraints","volume":"29","author":"Cai","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/opre.17.4.583","article-title":"Shortest paths in probabilistic graphs","volume":"17","author":"Frank","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB7","unstructured":"L. Fu, Real-time vehicle routing and scheduling in dynamic and stochastic networks, Ph.D. Thesis at the University of Alberta, 1996"},{"issue":"1","key":"10.1016\/S0377-2217(01)00354-X_BIB8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s004460050023","article-title":"Distributed shortest-path protocols for time-dependent networks","volume":"10","author":"Orda","year":"1996","journal-title":"Distributed Computing"},{"issue":"3","key":"10.1016\/S0377-2217(01)00354-X_BIB9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","article-title":"Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length","volume":"37","author":"Orda","year":"1990","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB10","series-title":"Distance in Graphs","author":"Buckley","year":"1990"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB11","first-page":"347","article-title":"Shortest distance reliability of probabilistic networks computer","volume":"3","author":"Mirchandani","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB12","series-title":"Proceedings of 1997 IEEE International Conference on Evolutionary Computing","first-page":"401","article-title":"Genetic algorithms for solving shortest path problems","author":"Gen","year":"1997"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB13","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB14","series-title":"Genetic Algorithms","author":"Buckles","year":"1994"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB15","series-title":"Learning with Genetic Algorithms: An Overview","first-page":"121","volume":"vol. 3","author":"DeJong","year":"1998"},{"issue":"2","key":"10.1016\/S0377-2217(01)00354-X_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0893-9659(93)90020-N","article-title":"A finite-time algorithm for shortest path problems with time-varying costs","volume":"6","author":"Philpott","year":"1993","journal-title":"Applied Mathematics Letters"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB17","unstructured":"M. Wall, Galib \u2013 A C++ Library of Genetic Components, 1993. http:\/\/lancet.mit.edu\/ga\/"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB18","doi-asserted-by":"crossref","unstructured":"The Diebold Institute for Public Policy Studies Inc., Transportation Infostructures: The Development of Intelligent Transportation Systems, Praeger, New York, 1995","DOI":"10.5040\/9798216994220"},{"key":"10.1016\/S0377-2217(01)00354-X_BIB19","series-title":"Computer Networks and Their Protocols","author":"Davies","year":"1979"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170100354X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170100354X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:51:10Z","timestamp":1733280670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170100354X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S037722170100354X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00354-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}