A new model for path planning with interval data

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 1893-1899

  Chen, Xujin ^a   Hu, Jie ^a   Hu, Xiaodong ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Interval data; Minimum risk sum; Path planning

Indexed keywords

APPLICATIONS.; DECISION MAKERS; INTERVAL DATA; INTERVAL DATUMS; MINIMUM RISK-SUM; NEW MODELS; PATH PLANNING; PATH PROBLEMS; TIME BOUNDS; TRAVEL TIMES;

EID: 56549114060     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.06.002     Document Type: Article

References (17)

1. Kouvelis P., and Yu G. Roubust discrete optimization and its applications (1997), Kluwer Academic Publishers, Boston
2. Waller S.T., and Ziliaskopoulos A.K. On the online shortest path problem with limited arc cost dependencies. Networks 40 4 (2002) 216-227
3. Montemanni R., Gambardella L.M., and Donati A.V. A branch and bound algorithm for the robust shortest path problem with interval data. Operation Research Letters 32 (2004) 225-232
4. Gao S., and Chabini I. Optimal routing policy problems in stochastic time-dependent networks. Transportation Research Part B: Methodological 40 (2006) 93-122
5. Zieliński P. The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research 158 (2004) 570-576
6. Karaşan OE, Pinar MÇ, Yaman H. The robust shortest path problem with interval data. Optimization Online, 2001.
7. Yu G., and Yang J. On the robust shortest path problem. Computers Operations Research 25 (1998) 457-468
8. Fan Y., Kalaba R., and Moore J. Arriving on time. Journal of Optimization Theory and Applications 127 3 (2005) 497-513
9. Frank H. Shortest paths in probabilistic graphs. Operations Research 17 (1969) 583-599
10. Hall R.W. The fastest path through a network with random time-dependent travel times. Transportation Science 20 (1986) 182-188
11. Fu L., and Rilett L.R. Expected shortest paths in dynamic and stochastic traffic network. Transportation Research 32 (1998) 499-512
12. Miller-Hook E.D., and Mahmassani H.S. Least expected time paths in stochastic time-varying transportation networks. Transportation Science 34 (2000) 198-215
13. Joksch H.K. The shortest route problem with constraints. Journal of Mathematical Analysis and Applications 14 (1966) 191-197
14. Handler G., and Zang I. A dual algorithm for the constrained shortest path problem. Networks 10 (1980) 293-310
15. Henig M. The shortest path problem with two objective functions. European Journal of Opertional Research 25 (1985) 281-291
16. Marathe M.V., Ravi R., Sundaram R., Ravi S.S., Rosenkrantz D.J., and Hunt III H.B. Bicriteria network design problems. Journal of Algorithms 28 (1998) 142-171
17. Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17 (1992) 36-42