A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Variable Population Memetic Search: A Case Study on the Critical Node Problem
[article]
2019
arXiv
pre-print
Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems. Often, a population of fixed size was used in such algorithms to record some best solutions sampled during the search. However, given the particular features of the problem instance under consideration, a population of variable size would be more suitable to ensure the best search performance possible. In this work, we propose variable population memetic search (VPMS), where a
arXiv:1909.08691v1
fatcat:tc7nqzirljenfgtuguf5mt54zi