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

Andrew Lim^1,2 and Zhou Xu²

¹Dept Industrial Engineering and Engineering Management
Hong Kong University of Science and Technology
Clear Water Bay
Kowloon, Hong Kong
iealim@ust.hk

²Dept of Computer Science
National University of Singapore
3 Science Drive 2
Singapore 117543
xuzhou@comp.nus.edu.sg

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.

LNCS 2724, p. 1596 ff.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003