Customized genetic algorithm for facility allocation using p-median

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The p-median problem is classified as a NP-hard problem, which demands a long time for solution. To increase the use of the method in public management, commercial, military and industrial applications, several heuristic methods has been proposed in literature. In this work, we propose a customized Genetic Algorithm for solving the p-median problem, and we present its evaluation using benchmark problems of OR-library. The customized method combines parameters used in previous studies and introduces the evolution of solutions in stationary mode for solving PMP problems. The proposed Genetic Algorithm found the optimum solution in 37 of 40 instances of p-median problem. The mean deviation from the optimal solution was 0.002% and the mean processing time using CPU core i7 was 17.7s.

Cite

CITATION STYLE

APA

De, S. D., Costa, M. G. F., & Costa Filho, C. F. F. (2019). Customized genetic algorithm for facility allocation using p-median. In Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, FedCSIS 2019 (pp. 165–169). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.15439/2019F158

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free