A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost

I. Lin Wang, Yi Chang James Tsai, Feng Li

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)593-601
頁數9
期刊Computers and Industrial Engineering
60
發行號4
DOIs
出版狀態Published - 2011 五月

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

指紋 深入研究「A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost」主題。共同形成了獨特的指紋。

引用此