Urban Road Network Maintenance Scheduling Using Ant Colony Optimization

Abstract

In this study, an optimization model for road maintenance scheduling is proposed. The proposed model determines a maintenance schedule for a given set of links in an urban road network, that minimizes the total travel time during the maintenance period under a set of assumptions and a particular crew number constraint. It is assumed that all lanes of a road to be repaired are closed to traffic during the maintenance. Ant Colony Optimization (ACO), a suitable algorithm for discrete transportation problems, is employed in the proposed model. The model generates a set of roads to be closed for each maintenance day. The total travel time during the whole maintenance period is calculated using the deterministic user equilibrium assignment model. The proposed model is applied to a test network, and more efficient schedules in terms of total travel time are obtained compared to randomly generated schedules.

Keywords

• Maintenance scheduling
• Bi-level optimization
• Ant colony optimization

References

1. Fwa, T. F., Cheu, R. L., Muntasir, A., “Scheduling of pavement maintenance to minimize traffic delays”, Transportation Research Record, 1650: 28–44, (1998).
2. Martinelli, D. R., Xu, D., “Delay Estimation and Optimal Length For Four-Lane Divided Freeway Workzones”, Journal of Transportation Engineering, 122(2): 114–122, (1996).
3. Chang, Y., Sawaya, O. B., Chang, Y., “A Tabu Search Based Approach for Work Zone Scheduling”, Computer Science, August, (2000).
4. Cheu, R. L., Wang, Y., Fwa, T. F., “Genetic Algorithm-Simulation Methodology for Pavement Maintenance Scheduling”, Computer-Aided Civil and Infrastructure Engineering, 19: 446–455, (2004).
5. Lu, G., Xiong, Y., Ding, C., Wang, Y., “An optimal schedule for urban road network repair based on the greedy algorithm”, Plos One, 11(10): 1–15, (2016).
6. Ma, J., Cheng, L., Li, D., “Road Maintenance Optimization Model Based on Dynamic Programming in Urban Traffic Network”, Journal of Advanced Transportation, (2018).
7. Yang, D., Zhao, X., Chen, Y., Zhang, X., & Chen, C., “Study on the day-based work zone scheduling problem in urban road networks based on the day-to-day traffic assignment model”, Transportation Research Record, 2672(16): 14–22, (2018).
8. Rey, D., Bar-gera, H., Dixit, V. V, Waller, S. T., “A Branch-and-Price Algorithm for the Bilevel Network Maintenance Scheduling Problem”, Transportation Science Publication, 53(5): 1213–1499, (2019).

9. Dorigo, M., & Car, G. Di., “Ant Colony Optimization: A New Meta-Heuristic”, Proceedings of the 1999 Congress on Evolutionary Computation, Washington D.C., USA, (1999).