Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems
Ke Tang
Yi Mei
Xin Yao
Nature Inspired Comput. & Applic. Lab., Univ. of Sci. & Technol. of China, Hefei, China;
This paper appears in: Evolutionary Computation, IEEE Transactions on
Publication Date: Oct. 2009
Volume: 13,
Issue: 5
On page(s): 1151-1166
ISSN: 1089-778X
INSPEC Accession Number: 10879801
Digital Object Identifier: 10.1109/TEVC.2009.2023449
First Published: 2009-08-11
Current Version Published: 2009-09-22
Abstract
The capacitated arc routing problem (CARP) has attracted much attention during the last few years due to its wide applications in real life. Since CARP is NP-hard and exact methods are only applicable to small instances, heuristic and metaheuristic methods are widely adopted when solving CARP. In this paper, we propose a memetic algorithm, namely memetic algorithm with extended neighborhood search (MAENS), for CARP. MAENS is distinct from existing approaches in the utilization of a novel local search operator, namely Merge-Split (MS). The MS operator is capable of searching using large step sizes, and thus has the potential to search the solution space more efficiently and is less likely to be trapped in local optima. Experimental results show that MAENS is superior to a number of state-of-the-art algorithms, and the advanced performance of MAENS is mainly due to the MS operator. The application of the MS operator is not limited to MAENS. It can be easily generalized to other approaches.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
