EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
336. A risk-averse latency location-routing problem with stochastic travel times
Invited abstract in session TA-26: Applications to Logistics and Transportation, stream Combinatorial Optimization.
Tuesday, 8:30-10:00Room: 012 (building: 208)
Authors (first author is the speaker)
| 1. | Francisco Saldanha-da-Gama
|
| Sheffield University Management School | |
| 2. | Alan Osorio-Mora
|
| RPTU Kaiserslautern-Landau | |
| 3. | Paolo Toth
|
| DEI, University of Bologna |
Abstract
In this paper, a latency location routing problem with stochastic travel times is investigated. The problem is modeled as a two-stage stochastic program, by setting the location decisions at the first stage, and the routing decisions at the second one. A risk-averse decision-maker is assumed. An efficient and effective multi-start variable neighborhood search algorithm is proposed for tackling the problem. A sampling method is also presented for dealing with uncertainty captured by a continuous probability distribution. Several insights are provided based on the results of a series of computational tests performed to asses the methodological contributions provided by this work.
Keywords
- Combinatorial Optimization
- Transportation
- Stochastic Models
Status: accepted
Back to the list of papers