Greedy Genetic Algorithm for the Data Aggregator Positioning Problem in Smart Grids
Open Access
- 30 September 2021
- journal article
- research article
- Published by IBERAMIA: Sociedad Iberoamericana de Inteligencia Artificial in INTELIGENCIA ARTIFICIAL
- Vol. 24 (68), 123-137
- https://doi.org/10.4114/intartif.vol24iss68pp123-137
Abstract
In this work, we present a metaheuristic based on the genetic and greedy algorithms to solve an application of the set covering problem (SCP), the data aggregator positioning in smart grids. The GGH (Greedy Genetic Hybrid) is structured as a genetic algorithm, but it has many modifications compared to the classic version. At the mutation step, only columns included in the solution can suffer mutation and be removed. At the recombination step, only columns from the parent’s solutions are available to generate the offspring. Moreover, the greedy algorithm generates the initial population, reconstructs solutions after mutation, and generates new solutions from the recombination step. Computational results using OR-Library problems showed that the GGH reached optimal solutions for 40 instances in a total of 75 and, in the other instances, obtained good and promising values, presenting a medium gap of 1,761%.Keywords
This publication has 10 references indexed in Scilit:
- A Data Analytics/Big Data Framework for Advanced Metering Infrastructure DataSensors, 2021
- Analytics framework for optimal smart meters data processingElectrical Engineering, 2020
- Optimal placement of data concentrators for expansion of the smart grid communications networkIET Smart Grid, 2019
- Smart Meters and Advanced Metering InfrastructurePublished by Elsevier BV ,2019
- Review of Smart Meter Data Analytics: Applications, Methodologies, and ChallengesIEEE Transactions on Smart Grid, 2018
- Towards a Smart Grid CommunicationEnergy Procedia, 2015
- A variable neighborhood search algorithm for the multimode set covering problemJournal of Global Optimization, 2013
- Covering problems in facility location: A reviewComputers & Industrial Engineering, 2012
- An effective and simple heuristic for the set covering problemEuropean Journal of Operational Research, 2007
- A genetic algorithm for the set covering problemEuropean Journal of Operational Research, 1996