In the past this research efforts in optimizing earthwork processes focused mainly on minimizing transportation costs and mass haul distances, respectively. This kind of optimization problem, well known as earthwork allocation problem can be solved by applying linear programming techniques. As a result, the most cost-efficient cut-to-fill assignments will be found. In this article, starting from an optimal cut-to-fill assignment, we formulate a new corresponding combinatorial optimization problem. This earthwork section division problem arises when a large road project is divided into several linear construction sections and tendered to different normally non-cooperating construction companies. The optimization objective is to partition the optimized cut-to-fill-assignments in different earthwork sections with minimal earth movements between them. This problem is subjected to certain user-defined constraints, like number of sections, minimal and maximal section-length, etc. The proposed solution model will be integrated into an earthwork modeling and assessment system which allows performing a quantity take-off from a roadway model to provide the necessary input data for the optimization algorithms.     «

In the past this research efforts in optimizing earthwork processes focused mainly on minimizing transportation costs and mass haul distances, respectively. This kind of optimization problem, well known as earthwork allocation problem can be solved by applying linear programming techniques. As a result, the most cost-efficient cut-to-fill assignments will be found. In this article, starting from an optimal cut-to-fill assignment, we formulate a new corresponding combinatorial optimization proble...     »