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...
Main Authors: | Ping Guo, Changsheng Quan, Haizhu Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8709623/ |
Similar Items
-
Q-MeaMetaVC: An MVC Solver of a Large-Scale Graph Based on Membrane Evolutionary Algorithms
by: Chunmei Liao, et al.
Published: (2023-07-01) -
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
by: Yang Wang, et al.
Published: (2021-01-01) -
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
by: Ping Guo, et al.
Published: (2019-01-01) -
Two Heuristic Algorithms for the Minimum Weighted Connected Vertex Cover Problem Under Greedy Strategy
by: Qipeng Xie, et al.
Published: (2022-01-01) -
MEATSP: A Membrane Evolutionary Algorithm for Solving TSP
by: Ping Guo, et al.
Published: (2020-01-01)