Generalized Hybrid Evolutionary Algorithm Framework with a Mutation Operator Requiring no Adaptation

This paper presents a generalized hybrid evolutionary optimization structure that not only combines both nondeterministic and deterministic algorithms on their individual merits and distinct advantages, but also offers behaviors of the three originating classes of evolutionary algorithms (EAs). In addition, a robust mutation operator is developed in place of the necessity of mutation adaptation, based on the mutation properties of binary-coded individuals in a genetic algorithm. The behaviour of this mutation operator is examined in full and its performance is compared with adaptive mutations. The results show that the new mutation operator outperforms adaptive mutation operators while reducing complications of extra adaptive parameters in an EA representation

An improved adaptive genetic algorithm for mobile robot path planning analogous to TSP with constraints on city priorities

The material transportation planning with a mobile robot can be regarded as the ordered clustered traveling salesman problem. To solve such problems with different priorities at stations, an improved adaptive genetic simulated annealing algorithm is proposed. Firstly, the priority matrix is defined according to station priorities. Based on standard genetic algorithm, the generating strategy of the initial population is improved to prevent the emergence of non-feasible solutions, and an improved adaptive operator is introduced to improve the population ability for escaping local optimal solutions and avoid premature phenomena. Moreover, to speed up the convergence of the proposed algorithm, the simulated annealing strategy is utilized in mutation operations. The experimental results indicate that the proposed algorithm has the characteristics of strong ability to avoid local optima and the faster convergence speed

Adaptive Locally Constrained Genetic Algorithm For Least-Cost Water Distribution Network Design

Copyright © IWA Publishing 2014. The definitive peer-reviewed and edited version of this article is published in Journal of Hydroinformatics Vol.16 (2), pp. 288–301 (2014), DOI: 10.2166/hydro.2013.218 and is available at www.iwapublishing.comThis paper describes the development of an adaptive locally constrained genetic algorithm (ALCO-GA) and its application to the problem of least cost water distribution network design. Genetic algorithms have been used widely for the optimisation of both theoretical and real-world nonlinear optimisation problems, including water system design and maintenance problems. In this work we propose a heuristic-based approach to the mutation of chromosomes with the algorithm employing an adaptive mutation operator which utilises hydraulic head information and an elementary heuristic to increase the efficiency of the algorithm's search into the feasible solution space. In almost all test instances ALCO-GA displays faster convergence and reaches the feasible solution space faster than the standard genetic algorithm. ALCO-GA also achieves high optimality when compared to solutions from the literature and often obtains better solutions than the standard genetic algorithm

Adaptive Genetic Algorithm

In this paper we introduce an adaptive, \u27self-contained\u27 genetic algorithm (GA) with steady-state selection. This variant of GA utilizes empirically based methods for calculating its control parameters. The adaptive algorithm estimates the percentage of the population to be replaced with new individuals (generation gap). It chooses the solutions for crossover and varies the number of mutations, ail regarding the current population state. The state of the population is evaluated by observing some of its characteristic values, such as the best and worst individual\u27s cost function (fitness) values, the population average etc. Furthermore, a non-uniform mutation operator is introduced, which increases the algorithm\u27s efficiency. Adaptive method does not, however, restrict the applicability in any way. The described GA is applied to optimization of several multimodal functions with various degrees of complexity, employed earlier for comparative studies. Some deceptive problems were also taken into consideration, and a comparison between the adaptive and standard genetic algorithm has been made

Multi-agricultural Machinery Collaborative Task Assignment Based on Improved Genetic Hybrid Optimization Algorithm

To address the challenges of delayed scheduling information, heavy reliance on manual labour, and low operational efficiency in traditional large-scale agricultural machinery operations, this study proposes a method for multi-agricultural machinery collaborative task assignment based on an improved genetic hybrid optimisation algorithm. The proposed method establishes a multi-agricultural machinery task allocation model by combining the path pre-planning of a simulated annealing algorithm and the static task allocation of a genetic algorithm. By sequentially fusing these two algorithms, their respective shortcomings can be overcome, and their advantages in global and local search can be utilised. Consequently, the search capability of the population is enhanced, leading to the discovery of more optimal solutions. Then, an adaptive crossover operator is constructed according to the task assignment model, considering the capacity, path cost, and time of agricultural machinery; two-segment coding and multi-population adaptive mutation are used to assign tasks to improve the diversity of the population and enhance the exploration ability of the population; and to improve the global optimisation ability of the hybrid algorithm, a 2-Opt local optimisation operator and an Circle modification algorithm are introduced. Finally, simulation experiments were conducted in MATLAB to evaluate the performance of the multi-agricultural machinery collaborative task assignment based on the improved genetic hybrid algorithm. The algorithm's capabilities were assessed through comparative analysis in the simulation trials. The results demonstrate that the developed hybrid algorithm can effectively reduce path costs, and the efficiency of the assignment outcomes surpasses that of the classical genetic algorithm. This approach proves particularly suitable for addressing large-scale task allocation problems

Multi-population methods with adaptive mutation for multi-modal optimization problems

open access journalThis paper presents an efficient scheme to locate multiple peaks on multi-modal optimization problems by using genetic algorithms (GAs). The premature convergence problem shows due to the loss of diversity, the multi-population technique can be applied to maintain the diversity in the population and the convergence capacity of GAs. The proposed scheme is the combination of multi-population with adaptive mutation operator, which determines two different mutation probabilities for different sites of the solutions. The probabilities are updated by the fitness and distribution of solutions in the search space during the evolution process. The experimental results demonstrate the performance of the proposed algorithm based on a set of benchmark problems in comparison with relevant algorithms

MCPC: another approach to crossover in genetic algorithms

Genetic algorithms (GAs) are stochastic adaptive algorithms whose search method is based on simulation of natural genetic inheritance and Darwinian strive for survival. They can be used to find approximate solutions to numerical optimization problems in cases where finding the exact optimum is prohibitively expensive, or where . no algorithm is known. The main operator, which is the driving force of genetic algorithms, IS crossover. It combines the features of two parents and produces two offspring. This paper propases a Multiple Crossover Per Couple (MCPC) approach as an altemate method for crossover operators.Eje: Diseño de algoritmosRed de Universidades con Carreras en Informática (RedUNCI

A comparative study of adaptive mutation operators for metaheuristics

Genetic algorithms (GAs) are a class of stochastic optimization methods inspired by the principles of natural evolution. Adaptation of strategy parameters and genetic operators has become an important and promising research area in GAs. Many researchers are applying adaptive techniques to guide the search of GAs toward optimum solutions. Mutation is a key component of GAs. It is a variation operator to create diversity for GAs. This paper investigates several adaptive mutation operators, including population level adaptive mutation operators and gene level adaptive mutation operators, for GAs and compares their performance based on a set of uni-modal and multi-modal benchmark problems. The experimental results show that the gene level adaptive mutation operators are usually more efficient than the population level adaptive mutation operators for GAs