Allocating railroad maintenance funds by solving binary knapsack problems with precedence constraints

Charles S. Melching and Judith S. Liebman

Transportation Research Part B: Methodological, 1988, vol. 22, issue 3, 181-194

Abstract: The United States is faced with allocating funds from a limited budget to the repair or replacement of railroad track segments on military bases. The problem can be modeled as a very large binary knapsack problem having a single budget constraint and multiple precedence constraints. A procedure has been developed to convert this original problem into an equivalent knapsack problem with a single constraint and significantly fewer variables. The new knapsack problem, still too large to be solved optimally, is then solved efficiently by a heuristic which provides answers within a few percent of optimality. Furthermore, the quality of the solution improves with the size of the problem.

Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(88)90014-8
Full text for ScienceDirect subscribers only

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:eee:transb:v:22:y:1988:i:3:p:181-194

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().