Multidepot Two-Echelon Vehicle Routing Problem for Earthwork Allocation Optimization

Abstract

Prior to the construction of most engineering projects, earthwork is a complex and time-consuming task, requiring iterative operations in civil engineering. The effectiveness of earthworks determines the cost of many AEC (architecture, engineering, and construction) projects (e.g., road, embankment, railway, and slope engineering). As a result, creating effective earthwork planning is critical. The earthwork allocation problem is simplified in this study to the vehicle route problem (VRP), which is often studied in the field of transportation and logistics. An optimization model for the earthwork allocation path based on the modified genetic algorithm with a self-adaptive mechanism is developed to work out the global optimal hauling path for earthwork. The findings of the study are also used to shape the basic topographic shape of the Winter Olympic Skiing Course Project. Furthermore, a comparative study with the former methods is conducted to validate the performance of our proposed method on tackling such a multidepot two-echelon vehicle routing problem. Because of its flexibility, this optimization model is extremely compatible with various evolutionary methods in many fields, making future development viable and practicable.