An algorithm portfolio for the dynamic maximal covering location problem

作者：Calderin Jenny Fajardo^*; Masegosa Antonio D; Pelta David A

来源：Memetic Computing, 2017, 9(2): 141-151.

DOI：10.1007/s12293-016-0210-5

• Coverage
• Location
• Metaheuristics
• Algorithm portfolio

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.

• 出版日期2017-6