The niching method for obtaining global optima and local optima in multimodal functions

2003 ◽  
Vol 34 (11) ◽  
pp. 30-42 ◽  
Author(s):  
Masako Himeno ◽  
Ryutaro Himeno
2017 ◽  
Vol 50 (6) ◽  
pp. 1611-1616 ◽  
Author(s):  
Masato Anada ◽  
Yoshinori Nakanishi-Ohno ◽  
Masato Okada ◽  
Tsuyoshi Kimura ◽  
Yusuke Wakabayashi

Monte Carlo (MC)-based refinement software to analyze the atomic arrangements of perovskite oxide ultrathin films from the crystal truncation rod intensity is developed on the basis of Bayesian inference. The advantages of the MC approach are (i) it is applicable to multi-domain structures, (ii) it provides the posterior probability of structures through Bayes' theorem, which allows one to evaluate the uncertainty of estimated structural parameters, and (iii) one can involve any information provided by other experiments and theories. The simulated annealing procedure efficiently searches for the optimum model owing to its stochastic updates, regardless of the initial values, without being trapped by local optima. The performance of the software is examined with a five-unit-cell-thick LaAlO3film fabricated on top of SrTiO3. The software successfully found the global optima from an initial model prepared by a small grid search calculation. The standard deviations of the atomic positions derived from a dataset taken at a second-generation synchrotron are ±0.02 Å for metal sites and ±0.03 Å for oxygen sites.


2022 ◽  
Author(s):  
Francisco Daniel Filip Duarte

Abstract In optimization tasks, it is interesting to achieve a set of efficient solutions instead of one single output, in the case the best solution is not suitable. Many niching methods offer a diversified response, yet some important problems are common: (1) The most interesting solutions of each local optimum are not identified. Thus, the output is the overall population of solutions, which increases the work of the designer in verifying which solution is the most interesting. (2) Existing niching algorithms tend to distribute the solutions on the most promising regions, over-populating some local optima and sub-populating others, which leads to poor optimization.To solve these challenges, a novel niching method is presented, named local optimum ranking 2 (LOR2). This sorting methodology favors the exploration of a defined number of local optima and ranks each local population by objective value within each local optimum. Thus, is performed a multi-focus exploration, with an equalized number of solutions on each local optimum, while identifying which solutions are the local apices. To exemplify its application, the LOR2 algorithm is applied in the design optimization of a metallic cantilever beam. It achieves a set of efficient and diverse design configurations, offering both performance and diversity for structural design challenges.In addition, a second experiment describes how the algorithm can be applied to segment the domain of any function, into a mesh of similar sized or custom-sized elements. Thus, it can significantly simplify metamodels and reduce their computation time.


2021 ◽  
Author(s):  
Hardi M. Mohammed ◽  
Tarik A. Rashid

Abstract Fitness Dependent Optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to Particle Swarm Optimization (PSO) but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO, thus, the chaotic theory is used inside FDO to propose Chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem.


Author(s):  
Sam Noble ◽  
K Kurien Issac

The problem of determining wheel torques of a rover, to minimize friction requirement, has been addressed by many researchers. We address it by trying to understand the ways in which local optima can occur, and on the basis of that understanding, develop analytical and non-iterative algorithms for determining global optima. The problem is posed in two variations, with normal reaction forces on wheels bounded below by (a) zero, and (b) a positive limit. In both cases, the nature of optima is studied comprehensively, and illustrated by solving examples. Explicit expressions are used to find roots of up to a cubic polynomial. Our algorithms are on the average about an order of magnitude faster than an SQP based general optimization solver, when the latter is started from random guesses. Moreover, our algorithms were able to reach global minima without fail for all examples solved, which number more than a thousand.


2012 ◽  
Vol 532-533 ◽  
pp. 1830-1835
Author(s):  
Ying Zhang ◽  
Bo Qin Liu ◽  
Han Rong Chen

Due to the existence of large numbers of local and global optima of super-high dimension complex functions, general Particle Swarm Optimizer (PSO) methods are slow speed on convergence and easy to be trapped in local optima. In this paper, an Adaptive Particle Swarm Optimizer(APSO) is proposed, which employ an adaptive inertia factor and dynamic changes strategy of search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the functions, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. We test the proposed algorithm and compare it with other published methods on several super-high dimension complex functions, the experimental results demonstrate that this revised algorithm can rapidly converge at high quality solutions.


2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Yangjun Gao ◽  
Fengming Zhang ◽  
Yu Zhao ◽  
Chao Li

This paper proposes a Quantum-Inspired wolf pack algorithm (QWPA) based on quantum encoding to enhance the performance of the wolf pack algorithm (WPA) to solve the 0-1 knapsack problems. There are two important operations in QWPA: quantum rotation and quantum collapse. The first step enables the population to move to the global optima and the second step helps to avoid the trapping of individuals into local optima. Ten classical and four high-dimensional knapsack problems are employed to test the proposed algorithm, and the results are compared with other typical algorithms. The statistical results demonstrate the effectiveness and global search capability for knapsack problems, especially for high-level cases.


2017 ◽  
Vol 2 (1) ◽  
pp. 68-82
Author(s):  
Hari Santoso ◽  
Lukman Fakih Lidimilah

Artificial AlgaeAlgorithm (AAA) is an optimization algorithm that has advantages of swarm algorithm model and evolution model. AAA consists of three phases of helical movement phase, reproduction, and adaptation. Helical movement is a three-dimensional movement with the direction of x, y, and z which is very influential in the rate of convergence and diversity of solutions. Helical motion optimization aims to increase the convergence rate by moving the algae to the best colony in the population. Algae Algorithm Optimization (AAA ') was tested with 25 objective functions of CEC'05 and implemented in case of pressure vessel design optimization. The results of the CEC'05 function test show that there is an increase in convergence rate at AAA ', but at worst condition of AAA' becomes less stable and trapped in local optima. The complexity analysis shows that AAA has the complexity of O (M3N2O) and AAA 'has the complexity of O (M2N2O) with M is the number of colonies, N is the number of algae individuals, and O is the maximum of the evaluation function. The results of the implementation of pressure vessel design optimization show that AAA's execution time increased 1,103 times faster than AAA. The increase in speed is due to the tournament selection process in AAA performed before the helical motion, whereas in AAA 'is done if the solution after movement is no better than before. At its best, AAA 'found a solution 4.5921 times faster than AAA. At worst, AAA 'stuck on local optima because helical movement is too focused on global best that is not necessarily global optima.  


2017 ◽  
Vol 2 (1) ◽  
pp. 14-20
Author(s):  
Sharmishta Suhas Desai ◽  
S. T. Patil

Large usage of social media, online shopping or transactions gives birth to voluminous data. Visual representation and analysis of this large amount of data is one of the major research topics today. As this data is changing over the period of time, we need an approach which will take care of velocity of data as well as volume and variety. In this paper, author has proposed a distributed method which will handle three dimensions of data and gives good results as compared to other method.  Traditional algorithms are based on global optima which are basically memory resident programs. Our approach which is based on optimized hoeffding bound uses local optima method and distributed map-reduce architecture. It does not require copying whole data set onto a memory. As the model build is frequently updated on multiple nodes concurrently, it is more suitable for time varying data. Hoeffding bound is basically suitable for real time data stream. We have proposed very efficient distributed map-reduce architecture to implement hoeffding tree efficiently. We have used deep learning at leaf level to optimize the hoeffding tree. Drift detection is taken care by the architecture itself no separate provision is required for this. In this paper, with experimental results it is proved that our method takes less learning time with more accuracy. Also distributed algorithm for hoeffding tree implementation is proposed.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Simon Fong ◽  
Suash Deb ◽  
Xin-She Yang ◽  
Yan Zhuang

Traditional K-means clustering algorithms have the drawback of getting stuck at local optima that depend on the random values of initial centroids. Optimization algorithms have their advantages in guiding iterative computation to search for global optima while avoiding local optima. The algorithms help speed up the clustering process by converging into a global optimum early with multiple search agents in action. Inspired by nature, some contemporary optimization algorithms which include Ant, Bat, Cuckoo, Firefly, and Wolf search algorithms mimic the swarming behavior allowing them to cooperatively steer towards an optimal objective within a reasonable time. It is known that these so-called nature-inspired optimization algorithms have their own characteristics as well as pros and cons in different applications. When these algorithms are combined with K-means clustering mechanism for the sake of enhancing its clustering quality by avoiding local optima and finding global optima, the new hybrids are anticipated to produce unprecedented performance. In this paper, we report the results of our evaluation experiments on the integration of nature-inspired optimization methods into K-means algorithms. In addition to the standard evaluation metrics in evaluating clustering quality, the extended K-means algorithms that are empowered by nature-inspired optimization methods are applied on image segmentation as a case study of application scenario.


Sign in / Sign up

Export Citation Format

Share Document