A Fixed-Length Subset Genetic Algorithm for the p-Median Problem

Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the classical p-median problem indicate that our method is superior and very close to the optimal solution. 1 Fixed-Length Subset Recombinations We study the Fixed Length Subset Genetic Algorithm (FLS-GA), whose candidate solutions are represented by the fixed-length subset (FLS), which can be defined as any subset with a fixed size for a given set. In FLS-GA, we adopt a subset encoding [CHWS97], which uses a list of elements to represent the candidate FLS. [Rad93] studies two pure recombinations for FLS, which are Random Respectful Recombination (RRR) and Random Assorting Recombination (RAR). We extend them to heuristic recombinations.

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: Andrew Lim, Zhou Xu
• Keywords: Fixed Length Subset, Fixed-Length Subset Recombinations, GECCO 2003, fixed-length Subset