Immune clonal selection algorithm for capacitated arc routing problem
Autor: | Hongna Ma, Jia Wang, Ronghua Shang, Licheng Jiao, Rustam Stolkin |
---|---|
Rok vydání: | 2015 |
Předmět: |
Mathematical optimization
education.field_of_study 021103 operations research Computational complexity theory business.industry Computer science Heuristic (computer science) Heuristic Population 0211 other engineering and technologies 02 engineering and technology Theoretical Computer Science Tree traversal Convergence (routing) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Local search (optimization) Geometry and Topology business education Metaheuristic Arc routing Software |
Zdroj: | Soft Computing. 20:2177-2204 |
ISSN: | 1433-7479 1432-7643 |
DOI: | 10.1007/s00500-015-1634-4 |
Popis: | In existing metaheuristics for solving the capacitated arc routing problem, traversal local search operators are often used to explore neighbors of the current solutions. This mechanism is beneficial for finding high-quality solutions; however, it entails a large number of function evaluations, causing high computational complexity. Hence, there is a need to further enhance the efficiency of such algorithms. This paper proposes a high-efficiency immune clonal selection algorithm for capacitated arc routing instances within a limited number of function evaluations. First, an improved constructive heuristic is used to initialize the antibody population. The initial antibodies generated by this heuristic help accelerate the algorithm's convergence. Second, we show how an immune clonal selection algorithm can select in favor of these high-quality antibodies. By adopting a variety of different strategies for different clones of the same antibody, it not only promotes cooperation and information exchanging among antibodies, but also increases diversity and speeds up convergence. Third, two different antibody repair operations are proposed for repairing various kinds of infeasible solutions. These operations cause infeasible solutions to move towards global optima. Experimental studies demonstrate improved performance over state-of-art algorithms, especially on medium-scale instances. |
Databáze: | OpenAIRE |
Externí odkaz: |