Abstract
The Periodic Capacitated Arc Routing Problem with Time Windows for the undirected case is introduced, a mathematical model is presented and tested on a set of generated instances. In the modeling it is considered that during the routes, the vehicles can pass and/or perform the services on the streets more slowly, or even, to park and wait the opening of the next time window, leaving the problem less restrictive. For each period, the arcs can be traversed at most only once by the same vehicle. A Hybrid Algorithm (HA) with an alternative mathematical model is used to find an initial feasible solution for the original problem. Computational results show that this approach is efficient in instances with up to 20 nodes, 31 edges, 31 required edges which require 125 services in a period of 7 days for a waste collection problem. Furthermore, it is considered a heterogeneous fleet with up to 3 vehicles.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
