A genetic algorithm for solving a capacitated p-Median problem

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

Abstract

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. 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 suggested in this work. The proposed GA is compared with a tabu search algorithm.

Citation

Correa, E., Steiner, M., Freitas, A., & Carnieri, C. (2004). A genetic algorithm for solving a capacitated p-Median problem. Numerical Algorithms, 35(2-4), 373-388. https://doi.org/10.1023/B%3ANuma.0000021767.42899.31

• Journal Article Type: Article
• Publication Date: Apr 1, 2004
• Deposit Date: Feb 10, 2017
• Journal: Numerical Algorithms
• Print ISSN: 1017-1398
• Electronic ISSN: 1572-9265
• Publisher: Springer Verlag
• Volume: 35
• Issue: 2-4
• Pages: 373-388
• DOI: https://doi.org/10.1023/B%3ANuma.0000021767.42899.31
• Publisher URL: http://dx.doi.org/10.1023/B:Numa.0000021767.42899.31
• Related Public URLs: http://link.springer.com/journal/11075