DMCA
2003): A fixed-length subset genetic algorithm for the p-median problem
| Venue: | In: Genetic and Evolutionary Computation – GECCO 2003, (E. Cantú-Paz et al., Eds.). — LNCS |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Lim_2003):a,
author = {Andrew Lim and Zhou Xu},
title = {2003): A fixed-length subset genetic algorithm for the p-median problem},
booktitle = {In: Genetic and Evolutionary Computation – GECCO 2003, (E. Cantú-Paz et al., Eds.). — LNCS},
year = {},
pages = {1596--1597},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1. Construct candidate set S ′ , and inherited pattern s0, from FLSs A and B; 2. Choose sub-optimal FLS from S ′ using the heuristic procedure H(S ′,s0). Let the result of H(S ′,s0) be the child of recombinations;
Keyphrases
fixed-length subset genetic algorithm p-median problem fixed-length subset candidate fl optimal solution heuristic recombination pure recombination rad93 study new heuristic recombination inherited pattern s0 candidate solution fixed-length subset recombination fixed length subset genetic algorithm classical recombination operation random respectful recombination construct candidate classical p-median problem indicate sub-optimal fl fixed size random assorting recombination heuristic procedure experimental result
