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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 7; s. 60774 - 60784
Hlavní autoři:	Guo, Ping, Quan, Changsheng, Chen, Haizhu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!