An Investment Staging Model for a Bridge Replacement Problem

Alberto Garcia-Diaz and Judith S. Liebman
Additional contact information
Alberto Garcia-Diaz: Texas A & M University, College Station, Texas
Judith S. Liebman: University of Illinois, Urbana, Illinois

Operations Research, 1980, vol. 28, issue 3-part-ii, 736-753

Abstract: This paper discusses the formulation and solution of a mathematical model of the selection and staging of bridge replacements in rural road networks. Both relaxation and decomposition strategies are used. First, a relaxation of the problem into a decomposable shortest path problem allows the identification of the bridge replacement alternatives which are most promising with respect to user cost. Next, the planning horizon is divided into time periods which are then ordered according to their relative importance. Finally, another decomposition in the form of a lexicographic optimization is used to select and schedule the bridge replacements. Within this lexicographic optimization a sequence of computationally feasible integer programming problems is solved.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.736 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:3-part-ii:p:736-753

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().