A Novel Mixed-Integer Linear Programming Model for the Capacitated Arc Routing Problem Adapted to Roadside Management Operations
- Publisher:
- Institute of Electrical and Electronics Engineers (IEEE)
- Publication Type:
- Conference Proceeding
- Citation:
- 2025 IEEE 28th International Conference on Intelligent Transportation Systems (ITSC), 2025, 00, pp. 3372-3377
- Issue Date:
- 2025-11-21
Open Access
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
Roadside management is an issue in many territories worldwide. Decision-makers face multiple challenges in finding the right combination in scheduling roadside maintenance activities while meeting several objectives, such as minimising travelled distance and time while collecting the mowed biomass for future valorisation. This work addresses the problem of planning optimal configurations for Roadside Management Operations (RMO) under tactical and operational decisions. At the tactical decision level, the allocation of resources must be carried out for each technical centre operating within the territory. At an operational level, the routing of maintenance vehicles must be scheduled. For this purpose, a Mixed-Integer Linear Programming (MILP) model is proposed to formulate a new Capacitated Arc Routing Problem (CARP) adapted to RMO (which we denote CARP-RMO). We further evaluate our proposed model with benchmark instances and well-known literature heuristics and show that our proposed optimisation approach is better performing, especially when scaling up to larger areas and multiple constraints. A case study is also presented for the area of Neufchateau, France, based on real data collected from the local operation technical centres, for which we showcase that our optimisation method can achieve good operational performance for both an optimal travel time and efficient biomass collection.
Please use this identifier to cite or link to this item: