|
|||||
|
|
Optimizing road network daily maintenance operations with stochastic service and travel times |
|
| Affiliation: | 1. Department of Information Engineering, University of Brescia, Brescia, Italy;2. Department of Statistics and Operational Research, University of Valencia, Burjassot, Spain;3. Department of Mathematics for Economics and Business, University of Valencia, Valencia, Spain;4. Department of Applied Mathematics, Polytechnic University of Valencia, Valencia, Spain;1. FZI Research Center for Information Technology, Karlsruhe, Haid-und-Neu-Str. 10–14, 76131 Karlsruhe, Germany;2. School of Mathematics, University of Edinburgh, James Clerk Maxwell Building, The King''s Buildings, Peter Guthrie Tait Road, Edinburgh, EH9 3FD, United Kingdom;3. Faculty of Mechanical Engineering, TU Dortmund University, Leonhard-Euler-StraBe 5, 44227 Dortmund, Germany |
| Abstract: | This paper studies optimization methods for a routing problem encountered in daily maintenance operations of a road network. Stochastic service and travel times on road segments are considered. The problem is formulated as a variation of the capacitated arc routing problem (CARP). A chance-constrained programming model is firstly developed and solved by a branch-and-cut algorithm. A stochastic programming model with recourse is also proposed to take into account the recourse costs in case of route failure. The problem is solved by an adaptive large neighborhood search algorithm. The computational experiments demonstrate the effectiveness of the algorithm. |
| Keywords: | Capacitated arc routing problem Stochastic Chance constrained programming model Stochastic programming model with recourse Adaptive neighborhood search algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |