Truck roung cut and fill problem in roadworks using integer programming

Abstract

Planning activies of materials distribuon in earthworks may represent a gain in the work as a whole. One way to savings in the construc1on is to minimize the total distance travelled by equipment, for example the trucks between the cut and fill in earthmoving areas. Some studies have been reported on the op1miza1on of material distribu1on between cut and fill areas, but only a few were applied in real projects considering mul-1ple trucks, moreover they do not do any analysis based on the distance between sta-1ons. This paper aims at presen1ng an integer programming model that minimizes the distance travelled by dump trucks in distribu1on ac1vi1es of earthwork materials. The developed model was based on a classical opera1onal research problem named vehicle rou1ng problem, which focus on the minimiza1on of the travelled way by a fleet of ve-hicles. The proposed approach was applied in two case studies whose findings highlight significant gains, in terms of flexibility of the planning process. Engineers, planners and analysts have an important computa1onal tool to support decision-making by using this model.