Since the membranealgorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membranealgorithms, the membranes have two functions...
详细信息
Since the membranealgorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membranealgorithms, the membranes have two functions: container and comparator. As a container, each membrane contains one evolutionaryalgorithm 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 evolutionaryalgorithm called membrane evolutionary algorithm framework (MEAF). Unlike the presented membranealgorithms, 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 membraneevolutionaryalgorithm 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.
暂无评论