Mathematical programming models for road repair scheduling—On aging bridges in Japan—

Abstract

This paper proposes two mathematical programming models to deal with a scheduling problem on the renovation of several roads that need to be repaired by a certain date. A typical example of the scheduling problem is the one for aging and deteriorating bridges in Japan. Our idea behind the formulation of the models is that, if one optimizes a set of roads simultaneously under repair, then the influence on traffic can be minimized. The first model turns out to be easy to solve since it can be rewritten as a linear 0-1 integer programming problem; however it would be too simple. The second model is designed to be realistic while its computation is a difficult task in general. This paper describes how to reduce its computational cost. In addition, we compare the results for the two models to grasp their features.

Keywords

• road repair scheduling
• shortest path
• user equilibrium flow
• linearization
• look-up table approach
• frank-wolfe algorithm