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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Published in:

    Publication date :

    1987-04-24


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A Method for Allocating Funds for Winter Maintenance

    Duaas, L. I. / Permanent International Association of Road Congresses | British Library Conference Proceedings | 1994


    Solving Large 0–1 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm

    Azad, M. A. / Rocha, A. M. / Fernandes, E. M. | British Library Online Contents | 2015



    RAILROAD MAINTENANCE SUPPORT SYSTEM, RAILROAD MAINTENANCE SUPPORT METHOD

    YANO KOJIN / OHHIRA NORIFUMI / HIRANO KIICHI | European Patent Office | 2025

    Free access