Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 6 , 3 ; 361-391
2007-01-01
31 pages
Article (Journal)
English
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
An Algorithm for Finding Reasonable Paths in Transit Networks
Online Contents | 2007
|Finding Reliable Shortest Paths in Dynamic Stochastic Networks
Online Contents | 2013
|Finding Reliable Shortest Paths in Dynamic Stochastic Networks
Transportation Research Record | 2013
|Finding the best multimodal paths in urban transportation networks
British Library Conference Proceedings | 1997
|