Cutter Location without Interference Based on Nine Points Optimization Algorithm

2013 ◽  
Vol 710 ◽  
pp. 325-328
Author(s):  
Li Han ◽  
Yue Zhang ◽  
You Jun Zhang ◽  
Tong Jiang
Keyword(s):  
Optimization Algorithm ◽  
Optimal Solution ◽  
Nc Machining ◽  
Iteration Algorithm ◽  
Search Range ◽  
Important Conclusion ◽  
Fast Calculation ◽  
Cutter Path ◽  
Point Set ◽  
Global Optimal

Cutter location without interference is the key question in complicated surface NC machining. Starting with the theory of minimum directed distance, this paper, aiming at the problem of cutter location path without interference in the NC machining, reaches an important conclusion that the nine points optimization algorithm based on change step and change search range can get the global optimal solution. Meanwhile, this algorithm solves the astringency problem in iteration algorithm, and avoids a number of point set calculations in the whole area. Due to its features of fast calculation, simple principal and so on, it turns out to be a very effective method to calculate cutter path in NC machining of complicated curved surface.

AO-BBO: A Novel Optimization Algorithm and Its Application in Plant Drug Extraction

2019 ◽  
Vol 19 (2) ◽  
pp. 139-145 ◽  
Author(s):  
Bote Lv ◽  
Juan Chen ◽  
Boyan Liu ◽  
Cuiying Dong
Keyword(s):  
Optimization Algorithm ◽  
Learning Strategy ◽  
Optimal Solution ◽  
Population Diversity ◽  
Global Optimal Solution ◽  
Plant Medicine ◽  
Suitability Index ◽  
Sensing Model ◽  
Local Optimal Solution ◽  
Global Optimal

<P>Introduction: It is well-known that the biogeography-based optimization (BBO) algorithm lacks searching power in some circumstances. </P><P> Material & Methods: In order to address this issue, an adaptive opposition-based biogeography-based optimization algorithm (AO-BBO) is proposed. Based on the BBO algorithm and opposite learning strategy, this algorithm chooses different opposite learning probabilities for each individual according to the habitat suitability index (HSI), so as to avoid elite individuals from returning to local optimal solution. Meanwhile, the proposed method is tested in 9 benchmark functions respectively. </P><P> Result: The results show that the improved AO-BBO algorithm can improve the population diversity better and enhance the search ability of the global optimal solution. The global exploration capability, convergence rate and convergence accuracy have been significantly improved. Eventually, the algorithm is applied to the parameter optimization of soft-sensing model in plant medicine extraction rate. Conclusion: The simulation results show that the model obtained by this method has higher prediction accuracy and generalization ability.</P>

Free Surface NC Machining Tool Path Optimization Algorithm Based on the Iso-Scallop Method

2015 ◽  
Vol 799-800 ◽  
pp. 1193-1196 ◽  
Author(s):  
Shu Kun Cao ◽  
Yong Hong Deng ◽  
Kun Zhang ◽  
Shi Ping Liu ◽  
Wen Jing Meng
Keyword(s):  
Free Surface ◽  
Optimization Algorithm ◽  
Tool Path ◽  
Nc Machining ◽  
Path Optimization ◽  
Surface Boundary ◽  
Step Size ◽  
Processing Efficiency ◽  
Tool Path Optimization ◽  
Point Set

In order to solve the problem of free surface processing of tool redundancy,the tool lack problem, and the demerit of low machining efficiency, etc., based on the iso-scallop method, based on the iso-scallop method, we put forward a kind of free surface NC machining tool path optimization algorithm,make the surface boundary discrete point set, which is generated by point set ring machining path, diagonal connection and then use the path of the adjacent curve, forming cutting tool machining line.finally, the calculation of step size and line spacing in machining path based on the iso-scallop method and the process of feeding direction is optimized. Proved by the simulation process, the algorithm is feasible and can effectively avoid tool redundancy and tool lack problems,concesquently, processing efficiency improved significantly.

scholarly journals A novel pigeon-inspired optimization with QUasi-Affine TRansformation evolutionary algorithm for DV-Hop in wireless sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772093274 ◽  
Author(s):  
Xiao-Xue Sun ◽  
Jeng-Shyang Pan ◽  
Shu-Chuan Chu ◽  
Pei Hu ◽  
Ai-Qing Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Optimization Algorithm ◽  
Affine Transformation ◽  
Optimal Solution ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Search Range ◽  
Homing Behavior

In modern times, swarm intelligence has played an increasingly important role in finding an optimal solution within a search range. This study comes up with a novel solution algorithm named QUasi-Affine TRansformation-Pigeon-Inspired Optimization Algorithm, which uses an evolutionary matrix in QUasi-Affine TRansformation Evolutionary Algorithm for the Pigeon-Inspired Optimization Algorithm that was designed using the homing behavior of pigeon. We abstract the pigeons into particles of no quality and improve the learning strategy of the particles. Having different update strategies, the particles get more scientific movement and space exploration on account of adopting the matrix of the QUasi-Affine TRansformation Evolutionary algorithm. It increases the versatility of the Pigeon-Inspired Optimization algorithm and makes the Pigeon-Inspired Optimization less simple. This new algorithm effectively improves the shortcoming that is liable to fall into local optimum. Under a number of benchmark functions, our algorithm exhibits good optimization performance. In wireless sensor networks, there are still some problems that need to be optimized, for example, the error of node positioning can be further reduced. Hence, we attempt to apply the proposed optimization algorithm in terms of positioning, that is, integrating the QUasi-Affine TRansformation-Pigeon-Inspired Optimization algorithm into the Distance Vector–Hop algorithm. Simultaneously, the algorithm verifies its optimization ability by node location. According to the experimental results, they demonstrate that it is more outstanding than the Pigeon-Inspired Optimization algorithm, the QUasi-Affine TRansformation Evolutionary algorithm, and particle swarm optimization algorithm. Furthermore, this algorithm shows up minor errors and embodies a much more accurate location.

A novel adaptive butterfly optimization algorithm

2018 ◽  
Vol 07 (04) ◽  
pp. 1850026 ◽  
Author(s):  
Bhupinder Singh ◽  
Priyanka Anand
Keyword(s):  
Optimization Algorithm ◽  
Sensory Modality ◽  
Optimal Solution ◽  
Bench Mark ◽  
Optimal Solutions ◽  
Global Optimal Solution ◽  
Simulation Process ◽  
Bee Colony ◽  
Global Optimal ◽  
Loss Of Diversity

Butterfly optimization algorithm (BOA) is an interesting bio-inspired algorithm that uses a nature inspired simulation model, based on the food foraging behavior of butterflies. A common problem with BOA is that in early stages of simulation process, it may converge to sub-optimal solutions due to the loss of diversity in its population. The sensory modality is the critical parameter which is responsible for searching new solutions in the nearby regions. In this work, an adaptive butterfly optimization algorithm is proposed in which a novel phenomenon of changing the sensory modality of BOA is employed during the optimization process in order to achieve better results in comparison to traditional BOA. The proposed Adaptive butterfly optimization algorithm (ABOA) is tested against seventeen standard bench mark functions. Its performance is then compared against existing standard optimization algorithms, namely artificial bee colony, firefly algorithm and standard butterfly optimization algorithm. The results indicate that the proposed adaptive BOA with improved parameter calculation mechanism produces superior results in terms of convergence and achievement of the global optimal solution efficiently.

Prediction Research on the Failure of Steam Turbine Based on Fruit Fly Optimization Algorithm Support Vector Regression

2012 ◽  
Vol 614-615 ◽  
pp. 409-413 ◽  
Author(s):  
Zhi Biao Shi ◽  
Ying Miao
Keyword(s):  
Neural Network ◽  
Support Vector Regression ◽  
Optimization Algorithm ◽  
Optimal Solution ◽  
Fruit Fly ◽  
Support Vector ◽  
Fruit Fly Optimization Algorithm ◽  
Global Optimal Solution ◽  
Fruit Fly Optimization ◽  
Global Optimal

In order to solve the blindness of the parameter selection in the Support Vector Regression (SVR) algorithm, we use the Fruit Fly Optimization Algorithm (FOA) to optimize the parameters in SVR, and then propose the optimization algorithm on the parameters in SVR based on FOA to fitting and simulate the experimental data of the turbine’s failures. This algorithm could optimize the parameters in SVR automatically, and achieve ideal global optimal solution. By comparing with the commonly used methods such as Support Vector Regression and Radial Basis Function neural network, it can be shown that the forecast results of FOA_SVR more accurate and the forecast speed is the fastest.

scholarly journals A New Global Optimization Algorithm for Solving Generalized Geometric Programming

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
San-Yang Liu ◽  
Chun-Feng Wang ◽  
Li-Xia Liu
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Geometric Programming ◽  
Optimal Solution ◽  
Global Optimization Algorithm ◽  
Global Optimal Solution ◽  
Linearization Technique ◽  
Generalized Geometric Programming ◽  
Global Optimal ◽  
Pruning Technique

A global optimization algorithm for solving generalized geometric programming (GGP) problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence of this algorithm is proved, and some experiments are reported to show the feasibility of the proposed algorithm.

Hybrid Multi-Population and Adaptive Search Range Strategy With Particle Swarm Optimization for Multimodal Optimization

2021 ◽  
Vol 12 (4) ◽  
pp. 146-168
Author(s):  
Shiqi Wang ◽  
Zepeng Shen ◽  
Yao Peng
Keyword(s):  
Particle Swarm Optimization ◽  
Optimal Solution ◽  
Search Space ◽  
Multimodal Optimization ◽  
Adaptive Search ◽  
Optimal Solutions ◽  
Search Range ◽  
Global Optimal Solution ◽  
Swarm Optimization ◽  
Global Optimal

This paper proposes an algorithm named hybrid multi-population and adaptive search range strategy with particle swarm optimization (ARPSO) for solving multimodal optimization problems. The main idea of the algorithm is to divide the global search space into multiple sub-populations searching in parallel and independently. For diversity increasing, each sub-population will continuously change the search area adaptively according to whether there are local optimal solutions in its search space and the position of the global optimal solution, and in each iteration, the optimal solution in this area will be reserved. For the purpose of accelerating convergence, at the global and local levels, when the global optimal solution or local optimal solution is found, the global search space and local search space will shrink toward the optimal solution. Experiments show that ARPSO has unique advantages for solving multi-dimensional problems, especially problems with only one global optimal solution but multiple local optimal solutions.

scholarly journals Spiral-based chaotic chicken swarm optimization algorithm for parameters identification of photovoltaic models

2021 ◽  
Author(s):  
Miao Li ◽  
Chunquan Li ◽  
Zhengyu Huang ◽  
Jiehui Huang ◽  
Gaige Wang ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimal Solution ◽  
Heuristic Methods ◽  
Global Optimal Solution ◽  
Swarm Optimization ◽  
Spiral Trajectory ◽  
Pv Systems ◽  
Reliable Performance ◽  
Global Optimal ◽  
Chicken Swarm Optimization

Abstract Photovoltaic (PV) systems are becoming increasingly significant because they can convert solar energy into electricity. The conversion efficiency is related to the PV models’ parameters, so it is crucial to identify parameters of PV models. Recently, various heuristic methods have been proposed to identify the parameters, but they cannot provide sufficient accurate and reliable performance. To address this problem, this paper proposes a spiral-based chaos chicken swarm optimization algorithm (SCCSO) including three strategies: i) the information-sharing strategy provides the latest information of the roosters for searching global optimal solution, beneficial to improve the exploitation ability; ii) the spiral motion strategy can enable hens and chicks to move towards their corresponding targets with a spiral trajectory, improving the exploration ability; iii) a self-adaptive-based chaotic disturbance mechanism is introduced around the global optimal solution to generate a promising solution for the worst chick at each iteration, thereby improving the convergence speed of the chicken flock. Besides, SCCSO is used for identifying different PV models such as the single diode, the double diode, and PV module models. Comprehensive analysis and experimental results show that SCCSO provides better robustness and accuracy than other advanced heuristic methods.

Research on Power Load Forecasting Model Based on Hybrid Algorithm Optimizing BP Neural Network

2014 ◽  
Vol 8 (1) ◽  
pp. 723-728 ◽  
Author(s):  
Chenhao Niu ◽  
Xiaomin Xu ◽  
Yan Lu ◽  
Mian Xing
Keyword(s):  
Neural Network ◽  
Optimization Algorithm ◽  
Load Forecasting ◽  
Optimal Solution ◽  
Electric Power System ◽  
Local Optimum ◽  
Good Prediction ◽  
Ant Colony Optimization Algorithm ◽  
The Neural Network ◽  
Power Load

Short time load forecasting is essential for daily planning and operation of electric power system. It is the important basis for economic dispatching, scheduling and safe operation. Neural network, which has strong nonlinear fitting capability, is widely used in the load forecasting and obtains good prediction effect in nonlinear chaotic time series forecasting. However, the neural network is easy to fall in local optimum, unable to find the global optimal solution. This paper will integrate the traditional optimization algorithm and propose the hybrid intelligent optimization algorithm based on particle swarm optimization algorithm and ant colony optimization algorithm (ACO-PSO) to improve the generalization of the neural network. In the empirical analysis, we select electricity consumption in a certain area for validation. Compared with the traditional BP neutral network and statistical methods, the experimental results demonstrate that the performance of the improved model with more precise results and stronger generalization ability is much better than the traditional methods.

Whale optimization algorithm based on lateral inhibition for image matching and vision-guided AUV docking

2020 ◽  
pp. 1-12
Author(s):  
Zheping Yan ◽  
Jinzhong Zhang ◽  
Jialing Tang
Keyword(s):  
Lateral Inhibition ◽  
Optimization Algorithm ◽  
Image Matching ◽  
Autonomous Underwater Vehicle ◽  
Optimal Solution ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Inhibition Mechanism ◽  
Whale Optimization ◽  
Accuracy And Stability

The accuracy and stability of relative pose estimation of an autonomous underwater vehicle (AUV) and a target depend on whether the characteristics of the underwater image can be accurately and quickly extracted. In this paper, a whale optimization algorithm (WOA) based on lateral inhibition (LI) is proposed to solve the image matching and vision-guided AUV docking problem. The proposed method is named the LI-WOA. The WOA is motivated by the behavior of humpback whales, and it mainly imitates encircling prey, bubble-net attacking and searching for prey to obtain the globally optimal solution in the search space. The WOA not only balances exploration and exploitation but also has a faster convergence speed, higher calculation accuracy and stronger robustness than other approaches. The lateral inhibition mechanism can effectively perform image enhancement and image edge extraction to improve the accuracy and stability of image matching. The LI-WOA combines the optimization efficiency of the WOA and the matching accuracy of the LI mechanism to improve convergence accuracy and the correct matching rate. To verify its effectiveness and feasibility, the WOA is compared with other algorithms by maximizing the similarity between the original image and the template image. The experimental results show that the LI-WOA has a better average value, a higher correct rate, less execution time and stronger robustness than other algorithms. The LI-WOA is an effective and stable method for solving the image matching and vision-guided AUV docking problem.

Sign in / Sign up

Export Citation Format

Share Document