The Applications of Improved Genetic Algorithm on Hypersonic Vehicle Trajectory Optimization

2012 ◽  
Vol 466-467 ◽  
pp. 1095-1099
Author(s):  
Liu Xu ◽  
Wei Min Li ◽  
Lin Zhang ◽  
An Tang Zhang
Keyword(s):  
Genetic Algorithm ◽  
Trajectory Optimization ◽  
Optimal Trajectory ◽  
Optimal Solution ◽  
High Sensitivity ◽  
Initial Guess ◽  
Cruise Missile ◽  
Trajectory Design ◽  
Improved Genetic Algorithm ◽  
Vehicle Trajectory

The Optimal trajectory design for hypersonic cruise missile is an optimal control problem with strict terminal constraints and variable final time. The classical algorithms always encounter the problems of high sensitivity to initial guess and local convergence in solving this problem. Aiming at these problems, genetic algorithm (GA) which is of good global convergence is applied to designing the optimal trajectory for hypersonic cruise missile. In order to improve the convergence rate of GA and overcome its premature problems, this text introduces a predatory search (PS) strategy to speed the convergence of genetic algorithms, robust and closer to the optimal solution. This text compares the original genetic algorithm (GA) and improved genetic algorithm by the emulate experiments, and the results show that the PSGA is a more effective method to design the Optimal trajectory for hypersonic cruise missile than the original genetic algorithm.

scholarly journals The Multiobjective Trajectory Optimization for Hypersonic Glide Vehicle Based on Normal Boundary Intersection Method

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Zhengnan Li ◽  
Tao Yang ◽  
Zhiwei Feng
Keyword(s):  
Trajectory Optimization ◽  
Optimization Problem ◽  
Pseudospectral Method ◽  
Optimization Method ◽  
Initial Guess ◽  
Programming Algorithm ◽  
Trajectory Design ◽  
Normal Boundary ◽  
Vehicle Trajectory ◽  
Intersection Method

To solve the multiobjective optimization problem on hypersonic glider vehicle trajectory design subjected to complex constraints, this paper proposes a multiobjective trajectory optimization method that combines the boundary intersection method and pseudospectral method. The multiobjective trajectory optimization problem (MTOP) is established based on the analysis of the feature of hypersonic glider vehicle trajectory. The MTOP is translated into a set of general optimization subproblems by using the boundary intersection method and pseudospectral method. The subproblems are solved by nonlinear programming algorithm. In this method, the solution that has been solved is employed as the initial guess for the next subproblem so that the time consumption of the entire multiobjective trajectory optimization problem shortens. The maximal range and minimal peak heat problem is solved by the proposed method. The numerical results demonstrate that the proposed method can obtain the Pareto front of the optimal trajectory, which can provide the reference for the trajectory design of hypersonic glider vehicle.

The Simulation and Analyses of Timing-Optimal Trajectory Planning for 6DOF Robot

2014 ◽  
Vol 716-717 ◽  
pp. 1555-1558
Author(s):  
Zhi Jian Gou
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Trajectory Planning ◽  
Optimal Trajectory ◽  
Optimal Solution ◽  
Global Search ◽  
Search Performance ◽  
Improved Genetic Algorithm ◽  
Genetic Operators ◽  
Optimal Trajectory Planning

The algorithm has been improved to the adaptive genetic operators and flow based on the basic theory of simple genetic algorithm and adopted elitism strategy to select the best individual for iterative operation. The improved genetic algorithm not only ensured better global search performance, but also improved the convergent speed. The optimal solution was obtained and simulated by the improved genetic algorithms under the kinematical constraints.

The Research of Timing-Optimal Trajectory Planning Based on Improved Genetic Algorithms

2013 ◽  
Vol 433-435 ◽  
pp. 562-565 ◽  
Author(s):  
Zhi Jian Gou
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Trajectory Planning ◽  
Optimal Trajectory ◽  
Optimal Solution ◽  
Search Performance ◽  
Improved Genetic Algorithm ◽  
Genetic Operators ◽  
Operation Process ◽  
Optimal Trajectory Planning

The algorithm has been improved to the adaptive genetic operators and flow based on the basic theory of simple genetic algorithm and adopted elitism strategy to select the best individual for iterative operation. Program the operation process in the MATLAB software. The improved genetic algorithm not only ensured better global search performance, but also improved the convergent speed. The optimal solution was obtained by the improved genetic algorithms under the kinematical constraints.

Solving vehicle routing problem by using improved genetic algorithm for optimal solution

2017 ◽  
Vol 21 ◽  
pp. 255-262 ◽  
Author(s):  
Mazin Abed Mohammed ◽  
Mohd Khanapi Abd Ghani ◽  
Raed Ibraheem Hamed ◽  
Salama A. Mostafa ◽  
Mohd Sharifuddin Ahmad ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Routing Problem

scholarly journals Prototype Filter Design Based on Channel Estimation for FBMC/OQAM Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Yongjin Liu ◽  
Xihong Chen ◽  
Yu Zhao
Keyword(s):  
Genetic Algorithm ◽  
Channel Estimation ◽  
Optimization Problem ◽  
Filter Design ◽  
Stop Band ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Global Optimal Solution ◽  
Prototype Filter ◽  
Global Optimal

A prototype filter design for FBMC/OQAM systems is proposed in this study. The influence of both the channel estimation and the stop-band energy is taken into account in this method. An efficient preamble structure is proposed to improve the performance of channel estimation and save the frequency spectral efficiency. The reciprocal of the signal-to-interference plus noise ratio (RSINR) is derived to measure the influence of the prototype filter on channel estimation. After that, the process of prototype filter design is formulated as an optimization problem with constraint on the RSINR. To accelerate the convergence and obtain global optimal solution, an improved genetic algorithm is proposed. Especially, the History Network and pruning operator are adopted in this improved genetic algorithm. Simulation results demonstrate the validity and efficiency of the prototype filter designed in this study.

Study on the Improvement of Genetic Algorithm by Using Vehicle Routing Problem

2013 ◽  
Vol 365-366 ◽  
pp. 194-198 ◽  
Author(s):  
Mei Ni Guo
Keyword(s):  
Genetic Algorithm ◽  
Optimal Solution ◽  
Mathematic Model ◽  
Simulation Software ◽  
Initial Population ◽  
Planning Problem ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Search Speed ◽  
Vehicle Path

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.

scholarly journals Discrete Robustness Optimization on Emergency Transportation Network Based on Prospect Theory

2019 ◽  
Vol 2019 ◽  
pp. 1-18 ◽  
Author(s):  
Zheng-kun Zhang ◽  
Chang-feng Zhu ◽  
Qing-rong Wang ◽  
Jia-shan Yuan
Keyword(s):  
Genetic Algorithm ◽  
Prospect Theory ◽  
Decision Maker ◽  
Transportation Network ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Decision Behavior ◽  
Bidirectional Search ◽  
Robustness Optimization

This paper focuses on the discrete robustness optimization of emergency transportation network with the consideration of timeliness and decision behavior of decision-maker under the limited rationality. Based on a situation that the nearer to disaster area, the higher probability of time delay, prospect theory is specially introduced to reflect the subjective decision behavior of decision-maker. Then, a discrete robustness optimization model is proposed with the purpose of the better timeliness and robustness. The model is based on the emergency transportation network with multistorage centers and multidisaster points. In order to obtain the optimal solution, an improved genetic algorithm is designed by introducing a bidirectional search strategy based on a newfangled path cluster to obtain specific paths that connect each storage centers and each disaster points. Finally, a case study is exhibited to demonstrate the reasonability of the model, theory, and algorithm. The result shows that the path cluster with the better timeliness and robustness can be well obtained by using the prospect theory and improved genetic algorithm. The analysis especially reveals that the robustness is correspondent to the risk aversion in prospect theory.

An Improved Genetic Algorithm for Digital Facility Layout Optimization Oriented Multi-Species and Variable-Batch Production Mode

2013 ◽  
Vol 694-697 ◽  
pp. 3632-3635
Author(s):  
Dao Guo Li ◽  
Zhao Xia Chen
Keyword(s):  
Genetic Algorithm ◽  
Facility Layout ◽  
Optimal Solution ◽  
Convergence Speed ◽  
Improved Genetic Algorithm ◽  
Layout Problem ◽  
Batch Production ◽  
Production Mode ◽  
Slow Convergence ◽  
Weak Points

When solving facility layout problem for the digital workshop to optimize the production, the traditional genetic algorithm has its flaws with slow convergence speed and that the accuracy of the optimal solution is not ideal. This paper analyzes those weak points and proposed an improved genetic algorithm according to the characteristics of multi-species and variable-batch production mode. The proposed approach improved the convergence speed and the accuracy of the optimal solution. The presented model of GA also has been tested and verified by simulation.

Blower Resource Scheduling Based on Elite Genetic Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 591-595 ◽  
Author(s):  
Guang Nian Yang ◽  
Wei Qi ◽  
Jun Zhou
Keyword(s):  
Genetic Algorithm ◽  
High Efficiency ◽  
Scheduling Algorithm ◽  
Sewage Treatment ◽  
Resource Scheduling ◽  
Optimal Solution ◽  
Task Completion ◽  
Toxic Substances ◽  
Improved Genetic Algorithm ◽  
Grid Resource

Now, our sewage treatment industry mainly depends on the blower of aeration act as metabolic, absorbed in the toxic substances. Blower resources management is the key issue of sewage treatment. Traditional resource scheduling algorithm exist some defects, for example it can not well meet the quality requirements and can not get the optimal solution. This article gives a new resource scheduling method based on improved genetic algorithm. It achieves grid resource scheduling by using real number encoding and activities point crossover. Experiments show that genetic algorithm can reduce executing time and task completion time, and further improve the scalability of resource scheduling model. This algorithm has stability and high efficiency in grid environment.

Sign in / Sign up

Export Citation Format

Share Document