Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Polynomial algorithms for nested univariate clustering
Discrete Mathematics
Solving the uncapacitated facility location problem using tabu search
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Development of a measure model for optimal planning of maintenance and improvement of roads
Computers and Industrial Engineering
Methods based on discrete optimization for finding road network rehabilitation strategies
Computers and Operations Research
Intuitionistic fuzzy MST clustering algorithms
Computers and Industrial Engineering
Hi-index | 0.00 |
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.