Abstract
The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem, which is of great significance in both theory and application. Evolutionary algorithms and local search algorithms have proved to be two important methods to solve this problem. However, the combination of these two methods does not perform well. In order to acquire an effective hybrid evolutionary algorithm, two new control strategies are proposed, which are taboo of solution-distance and intensive competition of individuals. A hybrid evolutionary algorithm for the MVC problem, referred to HETC, is proposed in this paper using these two strategies. The effectiveness of the proposed scheme is validated by conducting deep simulations. The results obtained by the proposed scheme are compared with results obtained by EWSL, the state-of-the-art algorithm, and NuMVC.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
