An Improved Memetic Algorithm for the Partial Vertex Cover Problem

Zhou, Yupeng; Qiu, Changze; Wang, Yiyuan; Fan, Mingjie; Yin, Minghao

doi:10.1109/access.2019.2895738

Cited by 8 publications

(9 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authors in [ 29 ] proposed a NHGA for MVCP to yield near-optimal solutions. In [ 30 ], authors studied an ameliorated genetic algorithm for the partial VCP to skip the local optimum by powerful vertex and adaptive mutation. All of their algorithm are based on the concept of degree.…”

Section: Related Workmentioning

confidence: 99%

“…Some parameterized algorithms about MVCP have been applied in biochemistry [ 23 , 24 ]. Moreover, the optimal approximation algorithm for MVCP have been proposed in [ 25 , 26 , 27 , 28 , 29 , 30 ]. Authors in [ 25 , 26 , 27 , 28 , 29 , 30 ] proposed the approximate optimization algorithm for MVCP by using the concept of degree.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks

Jia

et al. 2021

Sensors

View full text Add to dashboard Cite

For the law enforcement agencies, lawful interception is still one of the main means to intercept a suspect or address most illegal actions. Due to its centralized management, however, it is easy to implement in traditional networks, but the cost is high. In view of this restriction, this paper aims to exploit software-defined network (SDN) technology to contribute to the next generation of intelligent lawful interception technology, i.e., to optimize the deployment of intercept access points (IAPs) in hybrid software-defined networks where both SDN nodes and non-SDN nodes exist simultaneously. In order to deploy IAPs, this paper puts forward an improved equal-cost multi-path shortest path algorithm and accordingly proposes three SDN interception models: T interception model, ECMP-T interception model and Fermat-point interception model. Considering the location relevance of all intercepted targets and the operation and maintenance cost of operators from the global perspective, by the way, we further propose a restrictive minimum vertex cover algorithm (RMVCA) in hybrid SDN. Implementing different SDN interception algorithms based RMVCA in real-world topologies, we can reasonably deploy the best intercept access point and intercept the whole hybrid SDN with the least SDN nodes, as well as significantly optimize the deployment efficiency of IAPs and improve the intercept link coverage in hybrid SDN, contributing to the implementation of lawful interception.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks

Jia

et al. 2021

Sensors

View full text Add to dashboard Cite

show abstract

“…The data used to support the findings of this study are included within the article, which are described in detail in [ 30 , 32 ], respectively.…”

Section: Data Availabilitymentioning

confidence: 99%

SAMA: A Fast Self-Adaptive Memetic Algorithm for Detecting SNP-SNP Interactions Associated with Disease

Yin

Guan

Zhao

et al. 2020

BioMed Research International

View full text Add to dashboard Cite

Detecting SNP-SNP interactions associated with disease is significant in genome-wide association study (GWAS). Owing to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power and long running time. To tackle these drawbacks, a fast self-adaptive memetic algorithm (SAMA) is proposed in this paper. In this method, the crossover, mutation, and selection of standard memetic algorithm are improved to make SAMA adapt to the detection of SNP-SNP interactions associated with disease. Furthermore, a self-adaptive local search algorithm is introduced to enhance the detecting power of the proposed method. SAMA is evaluated on a variety of simulated datasets and a real-world biological dataset, and a comparative study between it and the other four methods (FHSA-SED, AntEpiSeeker, IEACO, and DESeeker) that have been developed recently based on evolutionary algorithms is performed. The results of extensive experiments show that SAMA outperforms the other four compared methods in terms of detection power and running time.

show abstract

“…For many large instances, exact algorithms cannot get a solution in a reasonable time. So, approximate algorithms play an important role in solving large instances, including ant colony algorithms [30], [31] (for weighted vertex cover), genetic algorithms [32], [33], local search algorithms [24], [25], [34], memetic algorithms [39] (for partial vertex cover), rough set based algorithms [38] (for hypergraphs) and so on. Among these algorithms, local search algorithms are superior to other approximation algorithms.…”

Section: B Minimum Vertex Cover Problemmentioning

confidence: 99%

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

Guo¹,

Quan

Chen³

2019

IEEE Access

View full text Add to dashboard Cite

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.

show abstract

An Improved Memetic Algorithm for the Partial Vertex Cover Problem

Cited by 8 publications

References 34 publications

On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks

On the Optimal Lawful Intercept Access Points Placement Problem in Hybrid Software-Defined Networks

SAMA: A Fast Self-Adaptive Memetic Algorithm for Detecting SNP-SNP Interactions Associated with Disease

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

Contact Info

Product

Resources

About