Please use this identifier to cite or link to this item:
|Title:||A fixed-length subset genetic algorithm for the p-median problem||Authors:||Lim, A.
|Issue Date:||2003||Citation:||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. ScholarBank@NUS Repository.||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. © Springer-Verlag Berlin Heidelberg 2003.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/39700||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 11, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.