(Created page with " == Abstract == 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 engine...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
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 deviation 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. | 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 deviation 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. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [http://people.csail.mit.edu/enikolova/papers/ENikolova-LSSC-cameraready.pdf http://people.csail.mit.edu/enikolova/papers/ENikolova-LSSC-cameraready.pdf] | * [http://people.csail.mit.edu/enikolova/papers/ENikolova-LSSC-cameraready.pdf http://people.csail.mit.edu/enikolova/papers/ENikolova-LSSC-cameraready.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/978-3-642-12535-5_41.pdf http://link.springer.com/content/pdf/10.1007/978-3-642-12535-5_41.pdf], | ||
| + | : [http://dx.doi.org/10.1007/978-3-642-12535-5_41 http://dx.doi.org/10.1007/978-3-642-12535-5_41] | ||
| + | |||
| + | * [https://dblp.uni-trier.de/db/conf/lssc/lssc2009.html#Nikolova09 https://dblp.uni-trier.de/db/conf/lssc/lssc2009.html#Nikolova09], | ||
| + | : [http://users.ece.utexas.edu/~nikolova/papers/ENikolova-LSSC-cameraready.pdf http://users.ece.utexas.edu/~nikolova/papers/ENikolova-LSSC-cameraready.pdf], | ||
| + | : [https://link.springer.com/chapter/10.1007/978-3-642-12535-5_41 https://link.springer.com/chapter/10.1007/978-3-642-12535-5_41], | ||
| + | : [https://www.scipedia.com/public/Nikolova_2010a https://www.scipedia.com/public/Nikolova_2010a], | ||
| + | : [https://doi.org/10.1007/978-3-642-12535-5_41 https://doi.org/10.1007/978-3-642-12535-5_41], | ||
| + | : [https://rd.springer.com/chapter/10.1007/978-3-642-12535-5_41 https://rd.springer.com/chapter/10.1007/978-3-642-12535-5_41], | ||
| + | : [https://academic.microsoft.com/#/detail/1498519796 https://academic.microsoft.com/#/detail/1498519796] | ||
Latest revision as of 16:13, 21 January 2021
Abstract
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 deviation 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.
Original document
The different versions of the original document can be found in:
- http://users.ece.utexas.edu/~nikolova/papers/ENikolova-LSSC-cameraready.pdf,
- https://link.springer.com/chapter/10.1007/978-3-642-12535-5_41,
- https://www.scipedia.com/public/Nikolova_2010a,
- https://doi.org/10.1007/978-3-642-12535-5_41,
- https://rd.springer.com/chapter/10.1007/978-3-642-12535-5_41,
- https://academic.microsoft.com/#/detail/1498519796
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1007/978-3-642-12535-5_41
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?