Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- 1 January 2003
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 144 (1), 27-38
- https://doi.org/10.1016/s0377-2217(01)00354-x
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A Note on Two Problems in Connexion with GraphsPublished by Association for Computing Machinery (ACM) ,2022
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Time-varying shortest path problems with constraintsNetworks, 1997
- Distributed shortest-path protocols for time-dependent networksDistributed Computing, 1996
- A finite-time algorithm for shortest path problems with time-varying costsApplied Mathematics Letters, 1993
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Shortest Paths in Probabilistic GraphsOperations Research, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959