Abstract
The Capacitated Arc Routing Problem (CARP) has attracted much attention during the last few years due to its wide applications in real life. A Memetic Algorithm with Extended Neighborhood Search (MAENS) was developed for solving this kind of problem. A powerful local search operator, the so-called MS operator, was introduced and plays an important role in MAENS. But the main disadvantage is the high computational cost due to the large enumerative number of selecting route groups. In this paper, we propose an improved approach for MAENS with a divide-and-conquer strategy, named MAENS+, which divides a large graph into small sub graphs in order to decrease enumerative number so as to reduce the computational cost. An adaptive method is used for choosing parameters during dividing. Experimental results show that MAENS+ manages to obtain the same level of solution quality as MAENS with much less computational time.
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.
