| Autor: |
Arroyo, José E. C., dos Santos, Paula M., Soares, Michele S., Santos, André G. |
| Zdroj: |
Advances in Artificial Intelligence - IBERAMIA 2010; 2010, p70-79, 10p |
| Abstrakt: |
This paper considers the p-median problem that consists in finding p-locals from a set of m candidate locals to install facilities minimizing simultaneously two functions: the sum of the distances from each customer to its nearest facility and the sum of costs for opening facilities. Since this is a NP-Hard problem, heuristic algorithms are the most suitable for solving such a problem. To determine nondominated solutions, we propose a multi-objective genetic algorithm (MOGA) based on a nondominated sorting approach. The algorithm uses an efficient elitism strategy and an intensification operator based on the Path Relinking technique. To test the performance of the proposed MOGA, we develop a Mathematical Programming Algorithm, called (-Constraint, that finds Pareto-optimal solutions by solving iteratively the mathematical model of the problem with additional constraints. The results show that the proposed approach is able to generate good approximations to the nondominated frontier of the bi-objective problem efficiently. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
