A survey of repair methods used as constraint handling techniques in evolutionary algorithms
S Salcedo-Sanz - Computer science review, 2009 - Elsevier
This paper provides a survey of the most important repair heuristics used in evolutionary
algorithms to solve constrained optimization problems. Popular techniques are reviewed …
algorithms to solve constrained optimization problems. Popular techniques are reviewed …
Pareto dominance-based multiobjective optimization method for distribution network reconfiguration
With ever increasing deployment of automation and communication systems in smart grids,
distribution network reconfiguration is becoming a viable solution for improving the …
distribution network reconfiguration is becoming a viable solution for improving the …
Revolutionizing photovoltaic systems: an innovative approach to maximum power point tracking using enhanced dandelion optimizer in partial shading conditions
Partial shading (PS) is a prevalent phenomenon that often affects photovoltaic (PV)
installations, leads to the appearance of numerous peaks in the power-voltage …
installations, leads to the appearance of numerous peaks in the power-voltage …
Reconfiguration of smart distribution systems with time varying loads using parallel computing
The problem of finding optimal configuration of automated/smart power distribution systems
topology is an NP-hard combinatorial optimization problem. It becomes more complex when …
topology is an NP-hard combinatorial optimization problem. It becomes more complex when …
The impacts of distributed energy sources on distribution network reconfiguration
A Asrari, T Wu, S Lotfifard - IEEE Transactions on Energy …, 2016 - ieeexplore.ieee.org
Thanks to the recent improvements in renewable energy technologies throughout the world,
distributed energy sources are now playing an undeniable role in supplying the electricity in …
distributed energy sources are now playing an undeniable role in supplying the electricity in …
Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
Abstract In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard
problem. Previous studies focus on approximation algorithms which search for an optimal …
problem. Previous studies focus on approximation algorithms which search for an optimal …
Small cell backhaul: challenges and prospective solutions
Operators are currently considering the deployment of small cells to complement their
macrocellular networks and increase their coverage and capacity. However, in order to roll …
macrocellular networks and increase their coverage and capacity. However, in order to roll …
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm
Along with the development of manufacture and services, the problem of distribution network
optimization has been growing in importance, thus receiving much attention from the …
optimization has been growing in importance, thus receiving much attention from the …
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
This paper focuses on the capacitated minimum spanning tree (CMST) problem. Given a
central processor and a set of remote terminals with specified demands for traffic that must …
central processor and a set of remote terminals with specified demands for traffic that must …
Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes: Case studies on the clustered shortest-path tree problem …
Abstract The Multifactorial Evolutionary Algorithm (MFEA) has emerged as an effective
variant of the evolutionary algorithm. MFEA has been successfully applied to deal with …
variant of the evolutionary algorithm. MFEA has been successfully applied to deal with …