Return
Optimization for Roads' Construction: Selection, Prioritization, and Scheduling
DOI:10.1111/mice.12370.png)
Abstract
En 中文
Limited resources (budget, labor, machinery) have a significant toll on the roads' construction. The question of interest is: given variations of resources over a lengthy construction time, what would be the best construction scheduling plan, or how to optimize the Gantt chart while considering two highly challenging features (1) prerequisite conditions and (2) the interdependency of the benefit of the projects' completions. We formulate it as a bilevel problem where the objective function is to minimize generalized costs and the lower level accounts for the drivers' route choice. We employ a solution algorithm based on a supervised learning technique (a linear regression model of machine-learning) and an integer programming problem and it is applied to the datasets of Winnipeg and Chicago. The regression model was found to be a tight approximation which resulted in an efficient algorithm (the CPU time is almost a linear function of the number of iterations). Moreover, the proposed methodology can render promising results (at least locally optimal solutions). This article is the first to formulate the Gantt chart using linear binary constraints and optimize it tailored to real-life case studies.
Keywords:
INTERDEPENDENT TRANSPORTATION PROJECTS
NETWORK DESIGN
MODEL
EQUILIBRIUM
ALGORITHMS
DYNAMICS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
9.1
Papers:
2.0K
Citations:
10.0K

