Methods based on discrete optimization for finding road network rehabilitation strategies

Authors:
Geir Dahl;Harald Minken
Affiliations:
Center of Mathematics for Applications, University of Oslo, Norway and Institute of Transport Economics, P.O. Box 6110 Etterstad, N-0602 Oslo, Norway;Institute of Transport Economics, P.O. Box 6110 Etterstad, N-0602 Oslo, Norway
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control

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

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study a dynamic optimization problem arising in the (long-term) planning of road rehabilitation activities. In this area one seeks a pavement resurfacing plan for a road network under budget constraints. Our main approach is to model this as an integer programming problem with underlying dynamic programming structure. We investigate properties of this model and propose a solution method based on Lagrangian relaxation where one gets subproblems that are shortest path problems. Some computational experiences based on realistic data are reported.