Evolutionary Algorithm
Recently Published Documents





2021 ◽  
Vol 7 ◽  
pp. e750
Eliézer Béczi ◽  
Noémi Gaskó

Determining the critical nodes in a complex network is an essential computation problem. Several variants of this problem have emerged due to its wide applicability in network analysis. In this article we study the bi-objective critical node detection problem (BOCNDP), which is a new variant of the well-known critical node detection problem, optimizing two objectives at the same time: maximizing the number of connected components and minimizing the variance of their cardinalities. Evolutionary multi-objective algorithms (EMOA) are a straightforward choice to solve this type of problem. We propose three different smart initialization strategies which can be incorporated into any EMOA. These initialization strategies take into account the basic properties of the networks. They are based on the highest degree, random walk (RW) and depth-first search. Numerical experiments were conducted on synthetic and real-world network data. The three different initialization types significantly improve the performance of the EMOA.

Guilherme Marcos Neves ◽  
Denilson Paulo Souza dos Santos

In this paper, it was studied the optimization of the cost of interplanetary missions with emphasis on reducing fuel consumption. To achieve this goal, a genetic algorithm was implemented to optimize the total impulse of orbital transfer. It was implemented a case of sending a space vehicle from Earth to a another planet using a gravity assist maneuver (swing by), in this paper it was chose sending a spacecraft from Earth to Mars with a close approach to the Venus. The method employed can be used for impulsive interplanetary missions in general, and so the solution found can become an initial solution for numerical methods of optimization of low thrust maneuvers

2021 ◽  
Vol 1 (4) ◽  
pp. 1-28
Denis Antipov ◽  
Benjamin Doerr

To gain a better theoretical understanding of how evolutionary algorithms (EAs) cope with plateaus of constant fitness, we propose the n -dimensional \textsc {Plateau} _k function as natural benchmark and analyze how different variants of the (1 + 1)  EA optimize it. The \textsc {Plateau} _k function has a plateau of second-best fitness in a ball of radius k around the optimum. As evolutionary algorithm, we regard the (1 + 1)  EA using an arbitrary unbiased mutation operator. Denoting by \alpha the random number of bits flipped in an application of this operator and assuming that \Pr [\alpha = 1] has at least some small sub-constant value, we show the surprising result that for all constant k \ge 2 , the runtime  T follows a distribution close to the geometric one with success probability equal to the probability to flip between 1 and k bits divided by the size of the plateau. Consequently, the expected runtime is the inverse of this number, and thus only depends on the probability to flip between 1 and k bits, but not on other characteristics of the mutation operator. Our result also implies that the optimal mutation rate for standard bit mutation here is approximately  k/(en) . Our main analysis tool is a combined analysis of the Markov chains on the search point space and on the Hamming level space, an approach that promises to be useful also for other plateau problems.

Energies ◽  
2021 ◽  
Vol 14 (20) ◽  
pp. 6651
Remigiusz Iwańkowicz

This paper addresses the problem of route planning for a fleet of electric vehicles departing from a depot and supplying customers with certain goods. This paper aims to present a permutation-based method of vehicle route coding adapted to the specificity of electric drive. The developed method integrated with an evolutionary algorithm allows for rapid generation of routes for multiple vehicles taking into account the necessity of supplying energy in available charging stations. The minimization of the route distance travelled by all vehicles was taken as a criterion. The performed testing indicated satisfactory computation speed. A real region with four charging stations and 33 customers was analysed. Different scenarios of demand were analysed, and factors affecting the results of the proposed calculation method were indicated. The limitations of the method were pointed out, mainly caused by assumptions that simplify the problem. In the future, it is planned for research and method development to include the lapse of time and for the set of factors influencing energy consumption by a moving vehicle to be extended.

2021 ◽  
Vol 11 (1) ◽  
Mohammad Reza Sharifi ◽  
Saeid Akbarifard ◽  
Kourosh Qaderi ◽  
Mohamad Reza Madadi

AbstractSimultaneous optimization of several competing objectives requires increasing the capability of optimization algorithms. This paper proposes the multi-objective moth swarm algorithm, for the first time, to solve various multi-objective problems. In the proposed algorithm, a new definition for pathfinder moths and moonlight was proposed to enhance the synchronization capability as well as to maintain a good spread of non-dominated solutions. In addition, the crowding-distance mechanism was employed to select the most efficient solutions within the population. This mechanism indicates the distribution of non-dominated solutions around a particular non-dominated solution. Accordingly, a set of non-dominated solutions obtained by the proposed multi-objective algorithm is kept in an archive to be used later for improving its exploratory capability. The capability of the proposed MOMSA was investigated by a set of multi-objective benchmark problems having 7 to 30 dimensions. The results were compared with three well-known meta-heuristics of multi-objective evolutionary algorithm based on decomposition (MOEA/D), Pareto envelope-based selection algorithm II (PESA-II), and multi-objective ant lion optimizer (MOALO). Four metrics of generational distance (GD), spacing (S), spread (Δ), and maximum spread (MS) were employed for comparison purposes. The qualitative and quantitative results indicated the superior performance and the higher capability of the proposed MOMSA algorithm over the other algorithms. The MOMSA algorithm with the average values of CPU time = 2771 s, GD = 0.138, S = 0.063, Δ = 1.053, and MS = 0.878 proved to be a robust and reliable model for multi-objective optimization.

2021 ◽  
Vol 15 ◽  
Tianyu Liu ◽  
Zhixiong Xu ◽  
Lei Cao ◽  
Guowei Tan

Hybrid-modality brain-computer Interfaces (BCIs), which combine motor imagery (MI) bio-signals and steady-state visual evoked potentials (SSVEPs), has attracted wide attention in the research field of neural engineering. The number of channels should be as small as possible for real-life applications. However, most of recent works about channel selection only focus on either the performance of classification task or the effectiveness of device control. Few works conduct channel selection for MI and SSVEP classification tasks simultaneously. In this paper, a multitasking-based multiobjective evolutionary algorithm (EMMOA) was proposed to select appropriate channels for these two classification tasks at the same time. Moreover, a two-stage framework was introduced to balance the number of selected channels and the classification accuracy in the proposed algorithm. The experimental results verified the feasibility of multiobjective optimization methodology for channel selection of hybrid BCI tasks.

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6351
Łukasz Rokicki

The issue of optimization of the configuration and operating states in low voltage microgrids is important both from the point of view of the proper operation of the microgrid and its impact on the medium voltage distribution network to which such microgrid is connected. Suboptimal microgrid configuration may cause problems in networks managed by distribution system operators, as well as for electricity consumers and owners of microsources and energy storage systems connected to the microgrid. Structures particularly sensitive to incorrect determination of the operating states of individual devices are hybrid microgrids that combine an alternating current and direct current networks with the use of a bidirectional power electronic converter. An analysis of available literature shows that evolutionary and swarm optimization algorithms are the most frequently chosen for the optimization of power systems. The research presented in this article concerns the assessment of the possibilities of using artificial immune systems, operating on the basis of the CLONALG algorithm, as tools enabling the effective optimization of low voltage hybrid microgrids. In his research, the author developed a model of a hybrid low voltage microgrid, formulated three optimization tasks, and implemented an algorithm for solving the formulated tasks based on an artificial immune system using the CLONALG algorithm. The conducted research consisted of performing a 24 h simulation of microgrid operation for each of the formulated optimization tasks (divided into 10 min independent optimization periods). A novelty in the conducted research was the modification of the hypermutation operator, which is the key mechanism for the functioning of the CLONALG algorithm. In order to verify the changes introduced in the CLONALG algorithm and to assess the effectiveness of the artificial immune system in solving optimization tasks, optimization was also carried out with the use of an evolutionary algorithm, commonly used in solving such tasks. Based on the analysis of the obtained results of optimization calculations, it can be concluded that the artificial immune system proposed in this article, operating on the basis of the CLONALG algorithm with a modified hypermutation operator, in most of the analyzed cases obtained better results than the evolutionary algorithm. In several cases, both algorithms obtained identical results, which also proves that the CLONALG algorithm can be considered as an effective tool for optimizing modern power structures, such as low voltage microgrids, including hybrid AC/DC microgrids.

Sign in / Sign up

Export Citation Format

Share Document