Tuning a Hybrid Optimization Algorithm by Determining the Modality of the Design Space

Author(s):  
Kurt Hacker ◽  
John Eddy ◽  
Kemper Lewis

Abstract In this paper we present an approach for increasing the efficiency of a hybrid Genetic/Sequential Linear Programming algorithm. We introduce two metrics for evaluating the modality of the design space and then use this information to efficiently switch between the Genetic Algorithm and SLP algorithm. The motivation for this study is an effort to reduce the computational expense associated with the use of a Genetic Algorithm by reducing the number of function evaluations needed to find good solutions. In the paper the two metrics used to evaluate the modality of the design space are the variance in fitness of the population of the designs in the Genetic Algorithm and the error associated with fitting a response surface to the designs evaluates by the Genetic Algorithm. The effectiveness of this approach is demonstrated by considering a highly multimodal Genetic Algorithm benchmarking problem.

2011 ◽  
Vol 308-310 ◽  
pp. 2413-2417
Author(s):  
Ying Guo Chen ◽  
Shuai Lu ◽  
Xiao Lu Liu ◽  
Ying Wu Chen

This paper combines a derivative-free hybrid optimization algorithm, generalize pattern search (GPS), with Treed Gaussian Processes (TGP) to create a new hybrid optimization algorithm. The goal is to use the method for top design of satellite system, in which the objective or constraint functions usually are computationally expensive black-box functions. TGP model partitions the design space into disjoint regions, and employs independent Gaussian Processes (GP) in each partition to represent the time consumption of true problem responses. Utilizing the TGP, we generate the new “promising” points, which are the combination of model-predicted values and estimated model errors. Then, these points are used to guide GPS search in the design space efficiently. The hybrid optimization method is applied to top design of multi-satellites cooperated observation. The results demonstrate that the proposed method can not only increase the chance of obtaining optimal solution but also cut down the cost of function evaluations.


2012 ◽  
Vol 170-173 ◽  
pp. 3695-3698
Author(s):  
Jun Ma ◽  
Li Ying Zhang

The vehicle routing planning in the process of logistics is a hot issue. There is a lack of traditional genetic algorithm used to solve this issue, so the taboos is introduced to improve it. The improved genetic algorithm based on taboos get high-search speed compared to the traditional genetic algorithm, and this improvement is verified by the example.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Li Wang ◽  
Xiaokai Wang

Scalable Video Coding (SVC) is a powerful solution to video application over heterogeneous networks and diversified end users. In the recent years, works mostly concentrate on transported layers or path for a single layer in the Software-Defined Network (SDN). This paper proposes the Novel Hybrid Optimization Algorithm for Scalable Video Coding (NHO-SVC) based on Genetic Algorithm to select the layer and path simultaneously. The algorithm uses the 0/1 knapsack programming model to set up the model, predicts the network states by the Autoregressive Integrated Moving Average Model (ARIMA), and then, makes decision based on Genetic Algorithm.


Sign in / Sign up

Export Citation Format

Share Document