Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2783| Title: | Solving Maximal Covering Location Problem (MCLP) by Using the Particle Swarm Optimization (PSO) Method | Authors: | Drakulić, D Marić, Miroslav Takači, Aleksandar A |
Issue Date: | 2012 | Rank: | M33 | Publisher: | Ruse : Rusenskij universitet | Related Publication(s): | Scientific Conference RU&SU 12 - Mathematics, Informatics, Physics, Proceedings | Conference: | Scientific Conference RU&SU 12 - Mathematics, Informatics, Physics (2012 ; Ruse) | Abstract: | The Maximal covering location problem (MCLP) represents a very popular and important optimization problem. The MCLP is NP-hard problem and there are many heuristics for solving it, like Tabu search, Genetic algorithm, Lagrangian relaxation, etc.. This paper describes a new approach to solving MCLP by using a Particle Swarm Optimization (PSO) method. At the end, the paper presents the results of computational tests of this approach on several public instances of MCPL. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/2783 |
| Appears in Collections: | Research outputs |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.