Search

The location of facilities (antennas, ambulances, police patrols, etc.) has been widely study in the literature. The maximal covering location problem aims at locating the facilities in such positions that maximizes certain notion of coverage. The model of the MCLP and the solutions obtained as a result of applying metaheuristics are difficult to understand for non-expert users in the areas of optimization. In this sense, this paper aims to propose the development of software to model and solve the problem MCLP, as well as data management and visualization of the solutions obtained following the application of metaheuristics algorithms implemented with the BiCIAM framework. For the management of the problem data we used combinations based on GIS. [ABSTRACT FROM AUTHOR]

When we face an optimization problem whose de finition (in some aspect) changes over the time, we are in the presence of a Dynamic Optimization Problem (DOP). The aspects that can change are the objective function, the variables' domain, the appearance/disappearance of variables or constraints, etc. This paper aims at providing a first introduction to those who are interested in the topic. Concretely, we present the DOPs, the most common performance measures as well as the methods used to solve them. We also briefly describe some of the most recent reviews and comment some current challenges and research opportunities in DOPs. [ABSTRACT FROM AUTHOR]