A genetic algorithm for the P-median problem

Correa, ES; Steiner, MTA; Freitas, AA; Carnieri, C

Abstract

Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated p-median problem. The proposed GA uses not only conventional genetic operators but also a new heuristic ''hypermutation'' operator proposed in this work. The proposed GA is compared with a tabu search algorithm.

Citation

Correa, E., Steiner, M., Freitas, A., & Carnieri, C. (2001). A genetic algorithm for the P-median problem. In L. Spector (Ed.), GECCO-2001: Proceedings of the Genetic and Evolutionary Computation Conference. San Francisco, CA, USA: Morgan Kaufmann Publishers

• Publication Date: Aug 3, 2001
• Deposit Date: Feb 10, 2017
• Series Title: Proceedings of the Genetic and Evolutionary Computation Conference
• Book Title: GECCO-2001: Proceedings of the Genetic and Evolutionary Computation Conference
• ISBN: 1558607749
• Publisher URL: https://kar.kent.ac.uk/13594/