An improved immune genetic algorithm for capacitated vehicle routing problem

6Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

The capacitated vehicle routing problem is an NP-hard problem. In this paper, it proposes a kind of dynamically adaptive immune genetic algorithm with automatic immune monitoring function. By setting an immune monitor, the algorithm automatically obtains the timing of regulating the antibody concentration and vaccination, and the dynamic antibody concentration regulation mechanism is designed to keep the variety of the antibody evolution process and prevent the algorithm from getting in trouble with local optimal solution. What is more, the manner of vaccination and extraction is designed to improve the global optimization of the algorithm, and the elite antibodies ensure the convergence. The experiment results show that the improved immune genetic algorithm takes good performance on the capacitated vehicle routing problem.

Cite

CITATION STYLE

APA

LinHui, C., & Luo, Z. (2014). An improved immune genetic algorithm for capacitated vehicle routing problem. Open Cybernetics and Systemics Journal, 8, 560–565. https://doi.org/10.2174/1874110X01408010560

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free