A multi-layered immune system for graph planarization problem

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

Abstract

This paper presents a new multi-layered artificial immune system architecture using the ideas generated from the biological immune system for solving combinatorial optimization problems. The proposed methodology is composed of five layers. After expressing the problem as a suitable representation in the first layer, the search space and the features of the problem are estimated and extracted in the second and third layers, respectively. Through taking advantage of the minimized search space from estimation and the heuristic information from extraction, the antibodies (or solutions) are evolved in the fourth layer and finally the fittest antibody is exported. In order to demonstrate the efficiency of the proposed system, the graph planarization problem is tested. Simulation results based on several benchmark instances show that the proposed algorithm performs better than traditional algorithms. Copyright © 2009 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Gao, S., Wang, R. L., Tamura, H., & Tang, Z. (2009). A multi-layered immune system for graph planarization problem. IEICE Transactions on Information and Systems, E92-D(12), 2498–2507. https://doi.org/10.1587/transinf.E92.D.2498

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