High-performance heuristics for optimization in stochastic traffic engineering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5910 LNCS, Issue , 2010, Pages 352-360

  Nikolova, Evdokia ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE LENGTH; EFFICIENT ALGORITHM; FEASIBLE SET; HEURISTIC APPROACH; LINEAR COMBINATIONS; NONCONVEX; OBJECTIVE FUNCTIONS; OPTIMAL ROUTES; OPTIMIZATION PROBLEMS; PERFORMANCE OF ALGORITHM; ROUTING MODEL; RUNNING TIME; SOLUTION ACCURACY; STANDARD DEVIATION; STOCHASTIC TRAFFIC; STOCHASTICITY; TASK PLANNING; TRAFFIC ENGINEERING;

HIGHWAY ENGINEERING; OPTIMIZATION; RISK ASSESSMENT; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TELECOMMUNICATION TRAFFIC;

HEURISTIC ALGORITHMS;

EID: 77953738847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12535-5_41     Document Type: Conference Paper

References (12)

1. Ackermann, H., Newman, A., Röglin, H., Vöcking, B.: Decision making based on approximate and smoothed pareto curves. Theor. Comput. Sci. 378(3), 253-270 (2007)
2. Bertsekas, D., Nedíc, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)
3. Carstensen, P.: The complexity of some problems in parametric linear and combinatorial programming. Ph.D. Dissertation, Mathematics Dept., Univ. of Michigan, Ann Arbor, Mich. (1983)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
5. Fan, Y., Kalaba, R., Moore II, J.E.: Arriving on time. Journal of Optimization Theory and Applications 127(3), 497-513 (2005)
6. Lim, S., Balakrishnan, H., Gifford, D.,Madden, S., Rus, D.: Stochastic motion planning and applications to traffic. In: Proceedings of the Eighth International Workshop on the Algorithmic Foundations of Robotics (WAFR), Guanajuato, Mexico (December 2008) (accepted)
7. Loui, R.P.: Optimal paths in graphs with stochastic or multidimentional weights. Communications of the ACM 26, 670-676 (1983)
8. Miller-Hooks, E.D., Mahmassani, H.S.: Least expected time paths in stochastic, time-varying transportation networks. Transportation Science 34, 198-215 (2000)
9. Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: Long, D., et al. (eds.) Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, pp. 131-141. AAAI, Menlo Park (2006)
10. Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.4168, pp. 552-563. Springer, Heidelberg (2006)
11. Papadimitriou, C., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84, 127-150 (1991)
12. Polychronopoulos, G., Tsitsiklis, J.: Stochastic shortest path problems with recourse. Networks 27(2), 133-143 (1996) (Pubitemid 126326948)