Genetic algorithms for dissimilar shortest paths based on optimal fuzzy dissimilar measure and applications

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3613, Issue PART I, 2005, Pages 312-320

  Li, Yinzhen ^a,b   He, Ruichun ^a   Liu, Linzhong ^a   Guo, Yaohuang ^b  

^a LANZHOU JIAOTONG UNIVERSITY   (China)

^b SOUTHWEST JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION MAKING; GENETIC ALGORITHMS; MATHEMATICAL MODELS; TRAFFIC CONTROL; TRANSPORTATION;

SHORTEST PATH PROBLEM (SPP); TRAFFIC NETWORKS; TRANSPORTATION NETWORKS; VEHICLE NAVIGATION SYSTEMS (VNS);

PROBLEM SOLVING;

EID: 26944467935     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539506_39     Document Type: Conference Paper

References (14)

1. B.V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik. Shortest paths algorithms:Theory and experimental evaluation[J]. Mathematical programming, 1996: 129-174.
2. J.Y.Yen. Finding the k shortest loopless paths in a network[J]. Management Science, 1971: 17, 721-716.
3. S.P. Miaou, S.M. Chin. Computing k-shortest paths for nuclear spent fuel highway transportation [J]. European Journal of Operational Research, 1991: 53,64-80.
4. D.R. Shier. On algorithms for finding the k shortest paths in a network[J]. Networks,1979: 17,341-352.
5. C.K.Lee. A multiple path routing strategy for Vehicle route guidance systems[J]. Tran. Res.,1994:2c, 185-195.
6. R.Dial, F.Glover, D.Karney. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees[J]. Networks,1999:9, 214-248.
7. K. Lombard, R.L. Church. The gateway shortest path problem:Generating alternative routes for a corridor location problem[J]. Geographical systems, 1993: 1,25-45.
8. Kanliang Wang,Yinfeng Xu. A model and algorithm on the path selection in dissimilar path problem [J]. TheoryMethod Application of system engineering, 2001: 1, 8-12.
9. M.Kuby. Programming models for facility dispersion: The p-dispersion and Maximum Dispersion Problems[J]. Geographical Analysis,1987: 19, 315-329.
10. E. Erkut. The discrete p-dispersion problem[J]. European Journal of operational Research,1990: 46,48-60.
11. N.M. Ruphail, et al. A Dss for dynamic pre-trip route planning[A]. Applications of advanced technologies in transportation engineering[C]: Proc of the 4th Intl. Conference,1995: 325-329.
12. Qun Yang . Research on the path selection based on multiple rational paths[J]. Journal of managing Engineering, 2004: 4, 42-45.
13. M.Gen. Bicriterion network design problem[R]. the 3d International Information and Management Science Conference, Dunhuang, P.R.of China,2004: 5, 419-425.
14. Yinzhen Li and Ruichun He. On the models and algorithms for finding dissimilar shortest paths in a traffic network[R]. The 7th National Operation Research Conference of China, Qingdao, China, 2004: 8