scholarly journals Feature Selection with a Local Search Strategy Based on the Forest Optimization Algorithm

2019 ◽  
Vol 121 (2) ◽  
pp. 569-592
Author(s):  
Tinghuai Ma ◽  
Honghao Zhou ◽  
Dongdong Jia ◽  
Abdullah Al-Dhelaan ◽  
Mohammed Al-Dhelaan ◽  
...  
Keyword(s):  
Feature Selection ◽  
Local Search ◽  
Optimization Algorithm ◽  
Search Strategy ◽  
Local Search Strategy

scholarly journals A Novel BBO Algorithm Based on Local Search and Nonuniform Variation for Iris Classification

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Lisheng Wei ◽  
Ning Wang ◽  
Huacai Lu
Keyword(s):  
Markov Chain ◽  
Local Search ◽  
Optimization Algorithm ◽  
Search Strategy ◽  
Convergence Condition ◽  
Classification Rate ◽  
Training Stage ◽  
Simulation Results ◽  
Effectiveness And Efficiency ◽  
Local Search Strategy

In order to improve the iris classification rate, a novel biogeography-based optimization algorithm (NBBO) based on local search and nonuniform variation was proposed in this paper. Firstly, the linear migration model was replaced by a hyperbolic cotangent model which was closer to the natural law. And, the local search strategy was added to traditional BBO algorithm migration operation to enhance the global search ability of the algorithm. Then, the nonuniform variation was introduced to enhance the algorithm in the later iteration. The algorithm could achieve a stronger iris classifier by lifting weaker similarity classifiers during the training stage. On this base, the convergence condition of NBBO was proposed by using the Markov chain strategy. Finally, simulation results were given to demonstrate the effectiveness and efficiency of the proposed iris classification method.

scholarly journals A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling

2021 ◽  
Vol 11 (11) ◽  
pp. 4837
Author(s):  
Mohamed Abdel-Basset ◽  
Reda Mohamed ◽  
Mohamed Abouhawwash ◽  
Victor Chang ◽  
S. S. Askar
Keyword(s):  
Local Search ◽  
Search Strategy ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Discrete Problem ◽  
Mutation Operator ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Local Search Strategy ◽  
Generalized Normal Distribution

This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling the permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete problem and GNDO generates continuous values, the largest ranked value rule is used to convert those continuous values into discrete ones to make GNDO applicable for solving this discrete problem. Additionally, the discrete GNDO is effectively integrated with a local search strategy to improve the quality of the best-so-far solution in an abbreviated version of HGNDO. More than that, a new improvement using the swap mutation operator applied on the best-so-far solution to avoid being stuck into local optima by accelerating the convergence speed is effectively applied to HGNDO to propose a new version, namely a hybrid-improved GNDO (HIGNDO). Last but not least, the local search strategy is improved using the scramble mutation operator to utilize each trial as ideally as possible for reaching better outcomes. This improved local search strategy is integrated with IGNDO to produce a new strong algorithm abbreviated as IHGNDO. Those proposed algorithms are extensively compared with a number of well-established optimization algorithms using various statistical analyses to estimate the optimal makespan for 41 well-known instances in a reasonable time. The findings show the benefits and speedup of both IHGNDO and HIGNDO over all the compared algorithms, in addition to HGNDO.

scholarly journals Noninferior Solution Grey Wolf Optimizer with an Independent Local Search Mechanism for Solving Economic Load Dispatch Problems

Energies ◽  
2019 ◽  
Vol 12 (12) ◽  
pp. 2274 ◽  
Author(s):  
Jianzhong Xu ◽  
Fu Yan ◽  
Kumchol Yun ◽  
Lifei Su ◽  
Fengshu Li ◽  
...  
Keyword(s):  
Power Systems ◽  
Local Search ◽  
Optimization Problem ◽  
Search Strategy ◽  
Local Optimum ◽  
Economic Load Dispatch ◽  
Problem Solution ◽  
Main Task ◽  
Grey Wolf ◽  
Local Search Strategy

The economic load dispatch (ELD) problem is a complex optimization problem in power systems. The main task for this optimization problem is to minimize the total fuel cost of generators while also meeting the conditional constraints of valve-point loading effects, prohibited operating zones, and nonsmooth cost functions. In this paper, a novel grey wolf optimization (GWO), abbreviated as NGWO, is proposed to solve the ELD problem by introducing an independent local search strategy and a noninferior solution neighborhood independent local search technique to the original GWO algorithm to achieve the best problem solution. A local search strategy is added to the standard GWO algorithm in the NGWO, which is called GWOI, to search the local neighborhood of the global optimal point in depth and to guarantee a better candidate. In addition, a noninferior solution neighborhood independent local search method is introduced into the GWOI algorithm to find a better solution in the noninferior solution neighborhood and ensure the high probability of jumping out of the local optimum. The feasibility of the proposed NGWO method is verified on five different power systems, and it is compared with other selected methods in terms of the solution quality, convergence rate, and robustness. The compared experimental results indicate that the proposed NGWO method can efficiently solve ELD problems with higher-quality solutions.

Sign in / Sign up

Export Citation Format

Share Document