Rank-based memetic algorithm for capacitated arc routing problems
The concepts of Rank Number and Rank Count are proposed to shed light onto the edge selection rules. The Rank-based Neighborhood Search (RENS) operator is introduced. Two rules, mapping rule and move rule, are constructed to explain work of virtual backtracking. The experimental results show that RMA performs very well.
rank memetic algorithm capacitated arc routing problems rank-based neighborhood search schema transition