A fixed-length subset genetic algorithm for the p-median problem

Authors:
Andrew Lim;Zhou Xu
Affiliations:
Dept Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Kowloon, Hong Kong and Dept of Computer Science, National University of Singapore, Singapore;Dept of Computer Science, National University of Singapore, Singapore
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 0
Cited 2

A scatter search-based heuristic to locate capacitated transshipment points

Computers and Operations Research
The TransRAR crossover operator for genetic algorithms with set encoding

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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.