scholarly journals Forecasting Nonlinear Chaotic Time Series with Function Expression Method Based on an Improved Genetic-Simulated Annealing Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Jun Wang ◽  
Bi-hua Zhou ◽  
Shu-dao Zhou ◽  
Zheng Sheng
Keyword(s):  
Genetic Algorithm ◽  
Time Series ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Fitness Function ◽  
Chaotic Time Series ◽  
Genetic Operators ◽  
Genetic Simulated Annealing Algorithm ◽  
Function Expression ◽  
Annealing Operation

The paper proposes a novel function expression method to forecast chaotic time series, using an improved genetic-simulated annealing (IGSA) algorithm to establish the optimum function expression that describes the behavior of time series. In order to deal with the weakness associated with the genetic algorithm, the proposed algorithm incorporates the simulated annealing operation which has the strong local search ability into the genetic algorithm to enhance the performance of optimization; besides, the fitness function and genetic operators are also improved. Finally, the method is applied to the chaotic time series of Quadratic and Rossler maps for validation. The effect of noise in the chaotic time series is also studied numerically. The numerical results verify that the method can forecast chaotic time series with high precision and effectiveness, and the forecasting precision with certain noise is also satisfactory. It can be concluded that the IGSA algorithm is energy-efficient and superior.

The Research on Mutil-Objective Location Routing Problem Based on Genetic Simulated Annealing Algorithm

2014 ◽  
Vol 543-547 ◽  
pp. 2842-2845 ◽  
Author(s):  
Gai Li Du ◽  
Nian Xue
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Fitness Function ◽  
Solution Space ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Genetic Simulated Annealing Algorithm ◽  
Location Routing ◽  
Annealing Algorithm

This paper analysis the basic principles of the genetic algorithm (GA) and simulated annealing algorithm (SA) thoroughly. According to the characteristics of mutil-objective location routing problem, the paper designs the hybrid genetic algorithm in various components, and simulate achieved the GSAA (Genetic Simulated Annealing Algorithm).Which architecture makes it possible to search the solution space easily and effectively without overpass computation. It avoids effectively the defects of premature convergence in traditional genetic algorithm, and enhances the algorithms global convergence. Also it improves the algorithms convergence rate to some extent by using the accelerating fitness function. Still, after comparing with GA and SA, the results show that the proposed Genetic Simulated Annealing Algorithm has better search ability. And the emulation experiments show that this method is valid and practicable.

Research on Image Technology with Application of K-Means Based on Genetic Simulated Annealing Algorithm in CT Image Segmentation

2014 ◽  
Vol 1022 ◽  
pp. 269-272
Author(s):  
Ling Li Zhu ◽  
Lan Wang
Keyword(s):  
Genetic Algorithm ◽  
Image Segmentation ◽  
Simulated Annealing ◽  
Clustering Analysis ◽  
Simulated Annealing Algorithm ◽  
Local Optimum ◽  
Initial Condition ◽  
Ct Image ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm

Aiming at the characteristic of medical images, this paper presents the improved genetic simulated annealing algorithm with K-means clustering analysis and applies in medical CT image segmentation. This improved genetic simulated annealing algorithm can be used to globally optimize k-means image segmentation functions to solve the locality and the sensitiveness of the initial condition. It can automatically adjust the parameters of genetic algorithm according to the fitness values of individuals and the decentralizing degree of individuals of the population and keep the variety of population for rapidly converging, and it can effectively avoid appearing precocity and plunging into local optimum. The example shows that the method is feasible, and better segmentation results have got to satisfy the request for 3D reconstruction, compared with k-means image segmentation and genetic algorithm based image segmentation.

Logistics Distribution Routing Optimization Algorithm

2014 ◽  
Vol 513-517 ◽  
pp. 1740-1743 ◽  
Author(s):  
Zhang Chun Hua ◽  
Hua Xin ◽  
Zhang Wei
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Memory Function ◽  
Memory Device ◽  
Routing Problem ◽  
Logistics Distribution ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm

Logistics distribution involves preparing goods in the distribution center or logistics node for most reasonable delivery according to the requirements of customers. Genetic algorithm is a random global search algorithm based on the principle of natural evolution. It can be a good solution to optimize the distribution routes. This paper combines genetic algorithm and the simulated annealing algorithm, to which memory device is added, in order to avoid best result losing in the crossover operator of the genetic algorithm. The experimental results show that a memory function with this genetic simulated annealing algorithm in solving the logistics distribution routing problem, can not only get a higher qualified solution, but can also significantly reduce the evolutionary generation that algorithm requires, and obtain solution to the problem in less time.

scholarly journals A Novel Fast Decision-making Method Based on Integrated Intelligent Technologies for Wind Disaster Management of Energy Manufacture

CONVERTER ◽  
2021 ◽  
pp. 169-190
Author(s):  
Baishang Zhang, Et al.
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Simulated Annealing Algorithm ◽  
Fitness Function ◽  
Evidence Theory ◽  
Nonlinear Problems ◽  
Case Based Reasoning ◽  
Genetic Operators ◽  
Electricity Grid ◽  
Fast Decision

Energy manufacture is very important to all of industries. Typhoons hit the power grid in China's southeast coastal areas frequently for the past few years, seriously affecting the industries’ operation. Therefore, making-decision of wind damage management for nation's electricity grid in real time is an urgent subject to be studied. The traditional decision making method is easy to be implemented, but is not proper for dealing with nonlinear problems in complex systems. The purpose of this article is to design a fast decision making framework for accomplishing fast decision making by making combination Case-Based Reasoning (CBR) with Rule-Based Reasoning (RBR), Genetic Algorithm (GA), which is called fast decision making method based on integrated intelligent technologies (FDMMBIIT). Compared with traditional methods, FDMMBIIT completes case adaptation with BPNN after extending case base. To make the decision-making more accurate, this article updated the multi-object genetic algorithm (MOGA) with adaptive genetic operators and a selection method by using the fitness function. Likewise, BPNN is improved with adaptive simulated annealing algorithm (ASAA), which is named as BPNNASAA. More important, this paper expands the frame theory by integrating it to the D/S evidence theory, exploring a novel solution to representing cases with incomplete information. The case of Guangdong demonstrates FDMMBIIT achieves better decision-making performance for storm disaster emergency management.

Three Dimensional Offline Packing Optimization Problem Based on Genetic Simulated Annealing Algorithm

2015 ◽  
Vol 744-746 ◽  
pp. 1919-1923
Author(s):  
Zhan Zhong Wang ◽  
Jing Fu ◽  
Lan Fang Liu ◽  
Rui Rui Liu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Three Dimensional ◽  
Packing Problem ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Final Optimization ◽  
Packing Optimization

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results and each suppliers’ current packing data.The experimental results show that the algorithm has a certain validity and practicability in multiple container packing problem.

scholarly journals Prediction of Chaotic Time Series Based on BEN-AGA Model

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
LiYun Su ◽  
Fan Yang
Keyword(s):  
Genetic Algorithm ◽  
Time Series ◽  
Network Model ◽  
Fitness Function ◽  
Activation Function ◽  
Single Step ◽  
Chaotic Time Series ◽  
Adaptive Genetic Algorithm ◽  
Observation Sequence ◽  
The Brain

Aiming at the prediction problem of chaotic time series, this paper proposes a brain emotional network combined with an adaptive genetic algorithm (BEN-AGA) model to predict chaotic time series. First, we improve the emotional brain learning (BEL) model using the activation function to change the two linear structures the amygdala and the orbitofrontal cortex into the nonlinear structure, and then we establish the brain emotional network (BEN) model. The brain emotional network model has stronger nonlinear calculation ability and generalization ability. Next, we use the adaptive genetic algorithm to optimize the parameters of the brain emotional network model. The weights to be optimized in the model are coded as chromosomes. We design the dynamic crossover probability and mutation probability to control the crossover process and the mutation process, and the optimal parameters are selected through the fitness function to evaluate the chromosome. In this way, we increase the approximation capability of the model and increase the calculation speed of the model. Finally, we reconstruct the phase space of the observation sequence based on the short-term predictability of the chaotic time series; then we establish a brain emotional network model and optimize its parameters with an adaptive genetic algorithm and perform a single-step prediction on the optimized model to obtain the prediction error. The model proposed in this paper is applied to the prediction of Rossler chaotic time series and sunspot chaotic time series. The experimental results verify the effectiveness of the BEN-AGA model and show that this model has higher prediction accuracy and more stability than other methods.

Damage Detection of Self-Anchored Suspension Bridge Based on Neural Network Model and Genetic-Simulated Annealing Algorithm

2011 ◽  
Vol 243-249 ◽  
pp. 1963-1967
Author(s):  
Qing Chen Zhang ◽  
Quan Sheng Sun
Keyword(s):  
Neural Network ◽  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Network Model ◽  
Neural Network Model ◽  
Simulated Annealing Algorithm ◽  
Suspension Bridge ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Bp Neural Network Model

According to the characteristics of self-anchored suspension bridge, a new method to detect damage is introduced in this paper.It works in two stages.First, a BP neural network model is built to predict damaged position. Next, based on the characteristics of genetic algorithm and simulated annealing algorithm, a new approach, genetic-simulated annealing algorithm, is put forward to identify damage extent of detected positions. Compared with the traditional genetic algorithm, the global convergence effect of this algorithm is enhanced by using of the Metropolis acceptance rule of the simulated annealing algorithm in the searching process.

Optimization of Cutting Conditions in Ultra-Precision Turning Based on Mixed Genetic-Simulated Annealing Algorithm

2006 ◽  
Vol 315-316 ◽  
pp. 617-622
Author(s):  
Ze Sheng Lu ◽  
Ming Hai Wang
Keyword(s):  
Genetic Algorithm ◽  
Surface Roughness ◽  
Simulated Annealing ◽  
Prediction Model ◽  
Simulated Annealing Algorithm ◽  
Cutting Conditions ◽  
Precision Turning ◽  
Genetic Simulated Annealing Algorithm ◽  
Ultra Precision ◽  
Annealing Algorithm

In ultra-precision turning process, the predictive modeling of surface roughness and the optimization of cutting conditions are the key factors to improve the quality of products and raise the efficiency of equipments. In this paper, the application of genetic algorithm in identifying nonlinear surface roughness prediction model is discussed, and presents mixed genetic-simulated annealing algorithm approach to optimization of cutting conditions in ultra-precision turning. The experiment was carried out with diamond cutting tools, for machining single crystal aluminum optics covering a wide range of machining conditions. The results of fitting of prediction model and optimal cutting conditions using genetic algorithm (GA) are compared with least square method and traditional optimal method.

PARALLEL TEST TASK SCHEDULING BASED ON GENETIC SIMULATED ANNEALING ALGORITHMS

2011 ◽  
Vol 10 (01) ◽  
pp. 207-214 ◽  
Author(s):  
CHENGJIN GAO ◽  
RUI XIA ◽  
JINJUN CHENG
Keyword(s):  
Simulated Annealing ◽  
Task Scheduling ◽  
Simulated Annealing Algorithm ◽  
Fitness Function ◽  
Task Sequence ◽  
Gene Encoding ◽  
Test Task ◽  
Parallel Test ◽  
Genetic Simulated Annealing Algorithm ◽  
The Mathematical Model

Parallel test task scheduling is vital to the feasibility, capability, and reliability of the Parallel ATS. This paper uses Genetic Simulated Annealing Algorithm (GASA) to find the optimized parallel test task schedule. The mathematical model of the problem is put forward first. Then the gene encoding and GASA operation method are designed. Also, the multi-objective fitness function using penalty coefficient which could satisfy both the resource constrains and task sequence restriction is introduced. The results of two simulated experiments show that the algorithm is feasible and efficient.

Sign in / Sign up

Export Citation Format

Share Document