MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem

Since the membrane algorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membrane algorithms, the membranes have two functions: container and comparator. As a container, each membrane contains one evolutionary...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access Jg. 7; S. 60774 - 60784
Hauptverfasser: Guo, Ping, Quan, Changsheng, Chen, Haizhu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Ant colony optimization
Approximation algorithms
Biomembranes
Containers
Evolution (biology)
Evolutionary algorithm
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
Knapsack problem
membrane computing
membrane evolutionary algorithm framework
Membranes
minimum vertex cover problem
Optimization
Sociology
Statistics
Traveling salesman problem
ISSN:2169-3536, 2169-3536
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since the membrane algorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membrane algorithms, the membranes have two functions: container and comparator. As a container, each membrane contains one evolutionary algorithm like genetic algorithm and ant colony algorithm. These algorithms are called sub-algorithms and used to evolve individuals. As a comparator, the membrane will compare the results of sub-algorithms, and select the best as the base of the next evolvement. This paper proposes a novel evolutionary algorithm called membrane evolutionary algorithm framework (MEAF). Unlike the presented membrane algorithms, the membranes in MEAF will be evolved to solve problems by using four operators that are abstracted from the life cycle of living cells. Based on MEAF, a membrane evolutionary algorithm called MEAMVC is proposed to solve the minimum vertex cover (MVC) problem. The experimental results show the advantages of MEAMVC when MEAMVC is compared with two state-of-the-art MVC algorithms proposed in recent years.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2915550