This study proposes a methodology for deriving the optimal work zone schedule for the annual routine maintenance planning in an infrastructure asset management system considering the (i) economies of scale in work zone costs due to work zone synchronization and (ii) user costs across the road network with traffic assignments. A key aspect of the proposed methodology is the ability to derive in detail optimal work zone schedules of realistic-scale road networks in 100 m sections for 365 days, which is beneficial in practice. To this end, an optimization model of the work zone schedule is newly formulated as a mixed-integer programming (MIP) problem, and a novel bilevel solution method for the model utilizing the conventional solver Gurobi Optimizer with MIP algorithms such as root relaxation, dual simplex, barrier methods, and cutting planes is proposed. In application examples, the proposed methodology is applied to two real-world road networks, which confirms that the optimal work zone schedule can be obtained in 313.7 s for a network with 2640, 100 m, sections and in 168,180 s (46 h and 43 min) for a network with 5038, 100 m, sections.

中文翻译：

---

考虑规模经济和用户成本的路网365天分段工区调度优化


本研究提出了一种方法，用于推导基础设施资产管理系统中年度例行维护计划的最佳工作区时间表，考虑到（i）由于工作区同步而导致的工作区成本的规模经济和（ii）道路上的用户成本具有流量分配的网络。该方法的一个关键方面是能够详细得出 365 天 100 m 路段中实际规模道路网络的最佳工作区时间表，这在实践中是有益的。为此，工作区调度的优化模型被新制定为混合整数规划（MIP）问题，并利用传统求解器 Gurobi Optimizer 和 MIP 算法（例如根松弛、对偶）对该模型采用新颖的双层求解方法。提出了单纯形法、屏障法和割平面。在应用示例中，所提出的方法应用于两个现实世界的道路网络，这证实了对于具有 2640 个 100 m 路段的网络，可以在 313.7 秒内获得最佳工作区调度，而在 168,180 秒（46 小时和 43 小时）内获得最佳工作区调度。分钟）对于具有 5038 个 100 m 路段的网络。