A hybrid evolutionary algorithm for the p-median problem

István Borgulya
2005 Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05  
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets of the candidate sites, apply a recombination operator tailored to the problem, and select symbols in chromosomes to mutate based on an explicit collective memory (named virtual loser). They also apply a sequence of two or three local search procedures to each new solution. Tests e.g. on the benchmark problem instances
more » ... problem instances of ORLIB returned results within 0.03% of the best solutions known.
doi:10.1145/1068009.1068118 dblp:conf/gecco/Borgulya05 fatcat:anvm3tucuncc5aytqaqwa7a23u