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: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8709623/ |
| _version_ | 1818874743489560576 |
|---|---|
| author | Ping Guo Changsheng Quan Haizhu Chen |
| author_facet | Ping Guo Changsheng Quan Haizhu Chen |
| author_sort | Ping Guo |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-19T13:15:27Z |
| format | Article |
| id | doaj.art-461a579955724f53b9ca1437532db38e |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-19T13:15:27Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-461a579955724f53b9ca1437532db38e2022-12-21T20:19:50ZengIEEEIEEE Access2169-35362019-01-017607746078410.1109/ACCESS.2019.29155508709623MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover ProblemPing Guo0https://orcid.org/0000-0002-5239-8896Changsheng Quan1Haizhu Chen2College of Computer Science, Chongqing University, Chongqing, ChinaCollege of Computer Science, Chongqing University, Chongqing, ChinaDepartment of Software Engineering, Chongqing College of Electronic Engineering, Chongqing, ChinaSince 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.https://ieeexplore.ieee.org/document/8709623/Evolutionary algorithmmembrane computingmembrane evolutionary algorithm frameworkminimum vertex cover problem |
| spellingShingle | Ping Guo Changsheng Quan Haizhu Chen MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem IEEE Access Evolutionary algorithm membrane computing membrane evolutionary algorithm framework minimum vertex cover problem |
| title | MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem |
| title_full | MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem |
| title_fullStr | MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem |
| title_full_unstemmed | MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem |
| title_short | MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem |
| title_sort | meamvc a membrane evolutionary algorithm for solving minimum vertex cover problem |
| topic | Evolutionary algorithm membrane computing membrane evolutionary algorithm framework minimum vertex cover problem |
| url | https://ieeexplore.ieee.org/document/8709623/ |
| work_keys_str_mv | AT pingguo meamvcamembraneevolutionaryalgorithmforsolvingminimumvertexcoverproblem AT changshengquan meamvcamembraneevolutionaryalgorithmforsolvingminimumvertexcoverproblem AT haizhuchen meamvcamembraneevolutionaryalgorithmforsolvingminimumvertexcoverproblem |