Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6861739 | Knowledge-Based Systems | 2018 | 22 Pages |
Abstract
We propose a Multi-Objective Memetic Algorithm (MOMA) to obtain high-quality approximations to the efficient front of the bi-objective obnoxious p-median problem, denoted as Bi-OpM. In particular, we introduce efficient crossover and mutation mechanisms. Additionally, we present several multi-objective local search methods. All the strategies are finally incorporated in a memetic algorithm which limits the search to the feasible region, thus performing an efficient exploration of the solutions space. Our experimentation compares several state-of-the-art procedures with the introduced MOMA emerging as the best performing method in all considered multi-objective metrics.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
J.M. Colmenar, R. MartÃ, A. Duarte,