An algorithm portfolio for the dynamic maximal covering location problem |
| |
| Authors: | Jenny Fajardo Calderín Antonio D Masegosa David A Pelta |
| |
| Institution: | 1.Department of Articial Intelligence and Infrastructure and Systems,Polytechnic Higher Institute José A. Echeverría,Havana,Cuba;2.Faculty of Engineering,University of Deusto,Bilbao,Spain;3.DeustoTech-Fundacion Deusto,Deusto Foundation,Bilbao,Spain;4.IKERBASQUE, Basque Foundation for Science,Bilbao,Spain;5.Department of Computer Science and AI,University of Granada,Granada,Spain |
| |
| Abstract: | The location of facilities (antennas, ambulances, police patrols, etc) has been widely studied in the literature. The maximal covering location problem aims at locating the facilities in such positions that maximizes certain notion of coverage. In the dynamic or multi-period version of the problem, it is assumed that the nodes’ demand changes with the time and as a consequence, facilities can be opened or closed among the periods. In this contribution we propose to solve dynamic maximal covering location problem using an algorithm portfolio that includes adaptation, cooperation and learning. The portfolio is composed of an evolutionary strategy and three different simulated annealing methods (that were recently used to solve the problem). Experiments were conducted on 45 test instances (considering up to 2500 nodes and 200 potential facility locations). The results clearly show that the performance of the portfolio is significantly better than its constituent algorithms. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
