A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost
✍ Scribed by I-Lin Wang; Yi-Chang James Tsai; Feng Li
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 419 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
✦ Synopsis
Because of shrinking budgets, transportation agencies are facing severe challenges in the preservation of deteriorating pavements. There is an urgent need to develop a methodology that minimizes maintenance and rehabilitation (M&R) cost. To minimize total network M&R cost of clustering pavement segments, we propose an integer programming model similar to an uncapacitated facility location problem (UFLP) that clusters pavement segments contiguously. Based on the properties of contiguous clustered pavement segments, we have transformed the clustering problem into an equivalent network flow problem in which each possible clustering corresponds to a path in the proposed acyclic network model. Our proposed shortest-path algorithm gives an optimal clustering of segments that can be calculated in a time polynomial to the number of segments. Computational experiments indicate our proposed network model and algorithm can efficiently deal with real-world spatial clustering problems.