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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Lim, A., & Xu, Z. (2003). A fixed-length subset genetic algorithm for the p-median problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1596–1597. https://doi.org/10.1007/3-540-45110-2_42
Mendeley helps you to discover research relevant for your work.