High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems [chapter]

Evdokia Nikolova
2010 Lecture Notes in Computer Science  
We consider a stochastic routing model in which the goal is to find the optimal route that incorporates a measure of risk. The problem arises in traffic engineering, transportation and even more abstract settings such as task planning (where the time to execute tasks is uncertain), etc. The stochasticity is specified in terms of arbitrary edge length distributions with given mean and variance values in a graph. The objective function is a positive linear combination of the mean and standard
more » ... ation of the route. Both the nonconvex objective and exponentially sized feasible set of available routes present a challenging optimization problem for which no efficient algorithms are known. In this paper we evaluate the practical performance of algorithms and heuristic approaches which show very promising results in terms of both running time and solution accuracy.
doi:10.1007/978-3-642-12535-5_41 fatcat:4tt3zxjc6fdajea7xuklwmnrfy