Earthwork Allocations with Nonconstant Unit Costs
- 1 March 1987
- journal article
- Published by American Society of Civil Engineers (ASCE) in Journal of Construction Engineering and Management
- Vol. 113 (1) , 34-50
- https://doi.org/10.1061/(asce)0733-9364(1987)113:1(34)
Abstract
Existing linear programming methods of earthwork allocations in road construction assume that the unit costs of earthwork activities are constant. This paper investigates the factors that affect the variations of unit costs and presents a model of earthwork allocations that incorporates nonconstant unit costs. The unit costs may vary with the total quantity of materials moved from cut to fill sections or disposal sites and from borrow pits to fill sections. For earthwork from cut sections, the unit costs can be established from the known quantities of cut sections (and other operating conditions) and can then be treated as constants in the model. For earthwork from borrow pits, the unit costs also vary with the total quantity to be moved from a borrow pit to fill sections, but this quantity is unknown. These unit costs are formulated as three‐component stepwise functions. The solution of the model is explored and a computer program, EARTHN, which solves the model quite efficiently, is developed. The model...Keywords
This publication has 8 references indexed in Scilit:
- Stochastic Priority Model for Aggregate BlendingJournal of Construction Engineering and Management, 1985
- Optimization Model for Aggregate BlendingJournal of Construction Engineering and Management, 1985
- Trade-Off of Gradation and Cost Requirements in Aggregate BlendingCement, Concrete and Aggregates, 1985
- Gradation, design, and cost consideration in blending aggregates for asphaltic concrete pavementsCanadian Journal of Civil Engineering, 1985
- Earthmoving LogisticsJournal of the Construction Division, 1981
- Earthwork Transportation Allocations: Operations ResearchJournal of the Construction Division, 1981
- Linear ProgrammingPublished by Elsevier ,1975
- A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming ProblemsOperations Research, 1971