Rank-based memetic algorithm for capacitated arc routing problems》.pdf

Applied Soft Computing 37 (2015) 572–584 Contents lists available at ScienceDirect Applied Soft Computing j o u r na l h o me p a ge : w w w. elsev /locate / a s o c Rank-based memetic algorithm for capacitated arc routing problems Zhurong Wang a,b,∗ , Haiyan Jin a,b , Manman Tian a a School of Computer Science and Engineering, Xi’an University of Technology, Xi’an 710048, China b Shaanxi Key Laboratory for Network Computing and Security Technology, Xi’an 710048, China a r t i c l e i n f o a b s t r a c t Article history: The capacitated arc routing problem (CARP) has garnered much attention recently, owing to its wide Received 2 November 2014 range of applications in the real world. This study describes an efficient memetic algorithm for solv- Received in revised form 26 June 2015 ing CARP. First, the concepts of Rank Number (RankNo), and Rank Count (RankCount) are proposed, to Accepted 1 August 2015 shed light onto the edge selection rules. Then, the essential backbone of the algorithm, the Rank-based Available online 2 September 2015 Neighborhood Search (RENS) operator, is introduced. Based on these above-mentioned concepts, meth- ods relating to selection and evaluation of edge(s) are designed to make local search more effective. Keywords: Two rules, namely mapping rule (MAR) and move rule (MOR), are constructed explain the working of Memetic algorithm