Abstract
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective local search technique for the CPMP. Computational results show the effectiveness of the proposed approach, when compared to the best performing heuristics so far presented in the literature.
Original language | English |
---|---|
Pages (from-to) | 263-280 |
Number of pages | 18 |
Journal | Journal of Heuristics |
Volume | 4 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1998 |
Externally published | Yes |
Keywords
- Bionomic algorithms
- Local search
- Location problems
- Metaheuristics