Abstract
Capacitated Arc Routing Problem (CARP) is known as an NP-hard combinatorial optimization problem. Chemical Reaction Optimization (CRO) is a recent metaheuristic inspired by the nature of chemical reactions of molecules and the mechanism of energy redistribution. CRO has been successfully exploited for solving a broad family of continuous and discrete optimization problems. In this paper, we propose CRO-CARP a CRO-based algorithm for solving CARP, where the potential solution of CARP is encoded in a molecule as a sequence of required arcs. The experimental results demonstrate clearly that CRO-CARP has superior performance when compared with other existing optimization approaches such as Genetic algorithm, Ant Colony Optimization, Tabu Search and Greedy Randomized Adaptive Search Procedure (GRASP) optimization.
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.
