Abstract
Problems involving maintenance, in most cases, require scheduled periodic interventions according to a frequency. In the case of roads and railways, there is a kind of monitoring and inspection during certain time intervals in order to ensure the flow on roads. The aim of this paper is to present and compare a result of two mathematical models for the Periodic Capacitated Arc Routing Problem (PCARP). This class of problems has gained more attention in the last decade, where it must be determined a route to one or multiple vehicles respecting their capacities, considering a discrete time horizon so that the demands of each arc are attended. The results are satisfactory when applied in this context maintenance.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
