College of Transportation Engineering, Chang'an University, Xi'an, China.
Engineering Research Center of Highway Infrastructure Digitalization, Ministry of Education, Xi'an, China.
PLoS One. 2022 Jun 8;17(6):e0269656. doi: 10.1371/journal.pone.0269656. eCollection 2022.
Although a wide range of literature has investigated the network-level highway maintenance plans and policies, few of them focused on the maintenance scheduling problem. This study proposes a methodology framework to model and compare two different maintenance scheduling strategies for highway networks, i.e., minimal makespan strategy (MMS) and minimal increased travel delay strategy (MITDS). We formulate MMS as a mixed integer linear programming model subject to the constraints of the quantity of manpower and the worst-first maintenance sequence. A bi-level programming model is proposed to quantify and optimize MITDS. The upper level model determines the optimal scheduling to minimize the increased traffic delays during the maintenance makespan. In the lower level, a modified day-to-day traffic assignment model is put forward to reflect the traffic evolution dynamics by simulating travelers' route choice behaviors. A simulated annealing algorithm and augmented Lagrange algorithm are employed to solve the two proposed models, respectively. Finally, a numerical example using a highway network is developed. The two proposed strategies are tested considering different traffic demands, numbers of engineering teams, and travelers' sensitivities to traffic congestion. The experiment results reveal that compared with MMS, MITDS extends makespan by 2 days though, it reduces the total increased travel delays by 4% and both MMS and MITDS can obtain the minimum total increased travel delays when the number of engineering teams is 6. The sensitivity analysis indicates that both the two strategies have the maximum and minimum total increased travel delays when the weight of prediction in travelers' perception is 0.3 and 0.7, respectively. The proposed framework has the potential to provide reference in implementing highway maintenance activities reasonably.
尽管有大量文献研究了网络级别的公路养护计划和政策，但很少有研究关注养护调度问题。本研究提出了一种方法框架，用于对公路网络的两种不同养护调度策略进行建模和比较，即最小完工时间策略（MMS）和最小增加旅行延迟策略（MITDS）。我们将 MMS 形式化为一个混合整数线性规划模型，受人力数量和最坏优先维护顺序的约束。提出了一个双层规划模型来量化和优化 MITDS。上层模型确定了最佳调度方案，以最小化维护总时间内增加的交通延误。在下层，提出了一个改进的逐日交通分配模型，通过模拟旅行者的路径选择行为来反映交通演化动态。采用模拟退火算法和增广拉格朗日算法分别求解这两个提出的模型。最后，使用一个公路网络开发了一个数值示例。考虑到不同的交通需求、工程团队数量和旅行者对交通拥堵的敏感度，对这两种提出的策略进行了测试。实验结果表明，与 MMS 相比，MITDS 将总工期延长了 2 天，但减少了总增加旅行延迟 4%，并且当工程团队数量为 6 时，MMS 和 MITDS 都可以获得最小的总增加旅行延迟。敏感性分析表明，当旅行者感知中的预测权重分别为 0.3 和 0.7 时，两种策略的总增加旅行延迟都有最大值和最小值。所提出的框架有潜力为合理实施公路养护活动提供参考。
