A hybrid evolutionary algorithm for the p-median problem

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 of ORLIB returned results within 0.03% of the best solutions known. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search - heuristic methods General Terms Algorithms. Keywords p-median problem, parallel computing, local search, evolutionary algorithm.

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: István Borgulya
• Keywords: Evolutionary Algorithm, GECCO 2005, P-median Problem, Steady-state Hybrid Ea