调度(生产过程)
计算机科学
弹性(材料科学)
地铁列车时刻表
任务(项目管理)
布线(电子设计自动化)
灾难恢复
运筹学
工程类
计算机网络
运营管理
系统工程
物理
热力学
操作系统
作者
Yanan Cheng,Zilin Zhang
标识
DOI:10.1109/srse56746.2022.10067487
摘要
In order to quickly recover the transportation network after a disaster, this paper considers a recovery scenario in which multiple repair teams perform repair work. Also, considering that there is an interval between repair tasks, the travel time spent before reaching each repair task to perform repair work is non-negligible, so the routing planning of repair teams is required. To solve this problem, this paper proposes a resilience-based routing planning and scheduling model for multiple repair teams and gives the task schedule of each repair team and the recovery completion time of each task in the whole repair work. In order to obtain the solution results of the proposed complex problem, this paper uses the Ant Colony System algorithm for solving it.
科研通智能强力驱动
Strongly Powered by AbleSci AI