A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.

by Daniel Karapetyan, Gregory Gutin

Abstract:

Memetic algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting the population size is one of the most important among them. Most of the algorithms in the literature fix the population size to a certain constant value. This reduces the algorithm's quality since the optimal population size varies for different instances, local search procedures, and runtimes. In this paper we propose an adjustable population size. It is calculated as a function of the runtime of the whole algorithm and the average runtime of the local search for the given instance. Note that in many applications the runtime of a heuristic should be limited and, therefore, we use this bound as a parameter of the algorithm. The average runtime of the local search procedure is measured during the algorithm's run. Some coefficients which are independent of the instance and the local search are to be tuned at the design time; we provide a procedure to find these coefficients. The proposed approach was used to develop a memetic algorithm for the multidimensional assignment problem (MAP). We show that our adjustable population size makes the algorithm flexible to perform efficiently for a wide range of running times and local searches and this does not require any additional tuning of the algorithm.

Reference:

A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem. (Daniel Karapetyan, Gregory Gutin), Evolutionary computation 19, 345–371, 2011.

Bibtex Entry:

@Article{Karapetyan2011b, author = {Karapetyan, Daniel and Gutin, Gregory}, title = {A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.}, journal = {Evolutionary computation}, year = {2011}, volume = {19}, pages = {345--371}, issn = {1063-6560}, abstract = {Memetic algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting the population size is one of the most important among them. Most of the algorithms in the literature fix the population size to a certain constant value. This reduces the algorithm's quality since the optimal population size varies for different instances, local search procedures, and runtimes. In this paper we propose an adjustable population size. It is calculated as a function of the runtime of the whole algorithm and the average runtime of the local search for the given instance. Note that in many applications the runtime of a heuristic should be limited and, therefore, we use this bound as a parameter of the algorithm. The average runtime of the local search procedure is measured during the algorithm's run. Some coefficients which are independent of the instance and the local search are to be tuned at the design time; we provide a procedure to find these coefficients. The proposed approach was used to develop a memetic algorithm for the multidimensional assignment problem (MAP). We show that our adjustable population size makes the algorithm flexible to perform efficiently for a wide range of running times and local searches and this does not require any additional tuning of the algorithm.}, arxivid = {1003.4314}, comment = {[<a href="https://www.dropbox.com/s/j4ftyvc3ujg1297/MapInstrancesGenerator.zip?dl=0">instance generator</a>]}, doi = {10.1162/EVCO\_a\_00026}, eprint = {1003.4314}, isbn = {1063-6560}, pmid = {20868263}, }