A novel evacuation path planning method based on improved genetic algorithm

In order to solve the problem of finding the best evacuation route quickly and effectively, in the event of an accident, a novel evacuation route planning method is proposed based on Genetic Algorithm and Simulated Annealing algorithm in this paper. On the one hand, the simulated annealing algorithm is introduced and a simulated annealing genetic algorithm is proposed, which can effectively avoid the problem of the search process falling into the local optimal solution. On the other hand, an adaptive genetic operator is designed to achieve the purpose of maintaining population diversity. The adaptive genetic operator includes an adaptive crossover probability operator and an adaptive mutation probability operator. Finally, the path planning simulation verification is carried out for the genetic algorithm and the improved genetic algorithm. The simulation results show that the improved method has greatly improved the path planning distance and time compared with the traditional genetic algorithm.

A Novel Particle Swarm Optimization with Genetic Operator and Its Application to TSP

To solve some problems of particle swarm optimization, such as the premature convergence and falling into a sub-optimal solution easily, we introduce the probability initialization strategy and genetic operator into the particle swarm optimization algorithm. Based on the hybrid strategies, we propose a improved hybrid particle swarm optimization, namely IHPSO, for solving the traveling salesman problem. In the IHPSO algorithm, the probability strategy is utilized into population initialization. It can save much more computing resources during the iteration procedure of the algorithm. Furthermore, genetic operators, including two kinds of crossover operator and a directional mutation operator, are used for improving the algorithm’s convergence accuracy and population diversity. At last, the proposed method is benchmarked on 9 benchmark problems in TSPLIB and the results are compared with 4 competitors. From the results, it is observed that the proposed approach significantly outperforms others on most the 9 datasets.

A Novel Particle Swarm Optimization With Genetic Operator and Its Application to TSP

To solve some problems of particle swarm optimization, such as the premature convergence and falling into a sub-optimal solution easily, we introduce the probability initialization strategy and genetic operator into the particle swarm optimization algorithm. Based on the hybrid strategies, we propose a improved hybrid particle swarm optimization, namely IHPSO, for solving the traveling salesman problem. In the IHPSO algorithm, the probability strategy is utilized into population initialization. It can save much more computing resources during the iteration procedure of the algorithm. Furthermore, genetic operators, including two kinds of crossover operator and a directional mutation operator, are used for improving the algorithm’s convergence accuracy and population diversity. At last, the proposed method is benchmarked on 9 benchmark problems in TSPLIB and the results are compared with 4 competitors. From the results, it is observed that the proposed approach significantly outperforms others on most the 9 datasets.

GENERATION OF OPTIMAL 2-D ROUTES USING GENETIC ALGORITHMS

The paper deals with practical issues of using the apparatus of genetic algorithms as one of the directions of optimization based on heuristic optimization methods. The adequacy of the application of genetic algorithms in the problem of two-dimensional optimal placement of a bit sequence in a bounded two-dimensonal space is shown. The probabilistic mechanism of application of the mutational genetic operator is used.

Study on optimal allocation of water resources in Dujiangyan irrigation district of China based on improved genetic algorithm

In order to distribute water resources reasonably, it is convenient to make full use of resources and produce high economic and social benefits. Taking the Dujiangyan irrigation area of China as an example, we discuss the idea of establishing and solving the optimal allocation model of water resources. Aiming at this area, a two-dimensional constraint model with the highest economic value, the minimum water shortage, the minimum underground water consumption and the necessary living water demand is established. In order to solve this model, we improve the multi-population genetic algorithm, extend the genetic optimization of the algorithm into two dimensions, take the population as the vertical dimension and the individual as the horizontal dimension, and transforms the cross genetic operator to copy the genetic operator and the mutation operator to only act on the vertical dimension, so as to optimize the allocation of such discrete objectives of water resources in the irrigation area with the particular model suitable for the region. The distribution results successfully control the water shortage rate of each area at a low level, which save the exploitation of groundwater to the maximum extent and produce high economic benefits. The improved algorithm proposed in this paper has a kind of strong optimization ability and provides a new solution for the optimization problem with multiple constraints.

Genetic clustering algorithm

The genetic algorithm of clustering of analysis objects in different data domains has been offered within the hybrid concept of intelligent information technologies development aimed to support decision-making. The algorithm makes it possible to account for different preferences of the analyst in clustering reflected in a calculation formula of fitness function. The place of this algorithm among those used for cluster analysis has been shown. The algorithm is simple in its program implementation, which increases its usage reliability. The used technology of evolutionary modeling is rather expanded in the mentioned algorithm. Firstly, the decimal chromosomes coding is used instead of the traditional binary coding. This has resulted from the fact that the chromosome genes condition is multiple and not binary. Moreover, this is due to the absence of the genetic operator of inversion in this algorithm. Secondly, a new genetic operator used for filtering has been implemented. This operator eliminates chromosomes that do not meet the required clusters quantity condition in a task. Such chromosomes can appear in the stochastic process of their evolution. The presented algorithm has been studied in a series of simulation experiments. As a result, it has been found that stabilization of splitting into clusters is reached when the number of completed generations of evolution is 200 and more, and the population size is rather small: from 150 chromosomes (in this case no considerable amount of random-access store is required). The calculations carried out on real data showed for this algorithm the high quality of clustering and the acceptable computing speed of the same order with the computing speed of SOM and “k-means” algorithms.

HPS_PSP: HIGH PERFORMANCE SYSTEM FOR PROTEIN STRUCTURE PREDICTION

Prediction of least energy conformation of a protein from its primary structure (chain of amino acids) is an optimization problem associated with a large complex energy landscape. In this study, a simple 2D hydrophobic–hydrophilic model was used to model the protein sequence, which allows the fast and efficient design of genetic algorithm-based protein structure prediction approach. The neighborhood search strategy is integrated into the genetic operator. The neighborhood search guides the genetic operator to regions in the computational space with good solutions. To prevent convergence to local optima, the proposed method employs crowding-based parent replacement strategy, which improves the performance of the algorithm and the ability to deal with multiple numbers of solutions. The proposed algorithm was tested with a standard benchmark of HP sequences and comparative results demonstrate that the proposed system beats most of the evolutionary algorithms for seven sequences. It finds the best energy for a sequence of length [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].