This paper presents a new Modified fruit fly optimization algorithm (MFOA) which is used to find the optimal PID controllers parameters applied to control a two-link robotic manipulator. The proposed new distribution ...
详细信息
ISBN:
(纸本)9781538621349
This paper presents a new Modified fruit fly optimization algorithm (MFOA) which is used to find the optimal PID controllers parameters applied to control a two-link robotic manipulator. The proposed new distribution law in MFOA for some of the fruit flies improves searching diversity in earlier iterations and increases solution precession in last iterations. In order to apply the PID controllers to the robot manipulator, a nonlinear feedback linearization control technique is employed which can fully linearize and decouple nonlinear robot's dynamics. Simulation results confirm that the MFOA-PID controller can achieve better closed-loop system responses with respect to the original FOA-PID controller.
To overcome the disadvantages of slow convergence speed, easily relapsing into local extremum and poor stability of traditional fruit fly optimization algorithm (FOA), an improved FOA incorporating Average Learning an...
详细信息
ISBN:
(纸本)9781538635735
To overcome the disadvantages of slow convergence speed, easily relapsing into local extremum and poor stability of traditional fruit fly optimization algorithm (FOA), an improved FOA incorporating Average Learning and Step Changing into the evolutionary process (AL-SC-FOA) is proposed. The combination of strategies of average learning and step changing can balance the ability of global search and local search of the algorithm, accelerate the convergence speed, improve the accuracy and enhance the stability of the algorithm. The proposed AL-SC-FOA is applied to six standard examples of the optimization test. The experimental results show that the AL-SC-FOA can avoid falling into the local optimum, which has higher precision and faster convergence speed, as well as better stability.
The traditional Ziegler-Nichols (Z-N) method usually fails to achieve the best control performance for tuning PID parameters. Thus, this paper proposed an immune flyfruitoptimizationalgorithm (IFOA) with the error ...
详细信息
ISBN:
(纸本)9781467397148
The traditional Ziegler-Nichols (Z-N) method usually fails to achieve the best control performance for tuning PID parameters. Thus, this paper proposed an immune flyfruitoptimizationalgorithm (IFOA) with the error performance criterion of ITAE as fitness function for the PID parameters optimized. Firstly, the proposed algorithm selected the best fruit flies for immune vaccines in the osphresis search mode. Then, it introduced the immune vaccination and immune selection mechanism in the visual search mode, so as to avoid flyfruitoptimizationalgorithm (FOA) falling into premature, and to overcome the artificial immune algorithm (AIA) shortcomings in the cumbersome and inefficient calculations. Finally, test the performance of the hybrid algorithm with four benchmarks, and apply it in PID parameters tuning. Simulation results show that the IFOA has fast convergence, good stability and higher precision, and also prove the feasibility and effectiveness in PID control parameter optimization.
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarizati...
详细信息
ISBN:
(纸本)9783319214108;9783319214092
The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.
Aiming at the problem of low convergence precision and premature convergence of fruit fly optimization algorithm (FOA), this paper proposes a novel fruit fly optimization algorithm with Levi flight and challenge proba...
详细信息
Aiming at the problem of low convergence precision and premature convergence of fruit fly optimization algorithm (FOA), this paper proposes a novel fruit fly optimization algorithm with Levi flight and challenge probability (LCFOA). We introduce the Levi flight mechanism and challenge adjustment process to coordinate the global exploration and local exploitation capabilities of the algorithm. Then, we designed an adaptive challenge factor in the challenge adjustment process to improve the convergence precision of the algorithm. The convergence performance of the algorithm is verified by 6 different benchmark functions. The numerical experimental results comfirmed that the proposed LCFOA has better search precision and convergence speed. (C) 2021 The Authors. Published by Elsevier B.V.
In this paper, a novel improved fruit fly optimization algorithm (IFOA) is proposed for solving the multidimensional knapsack problem (MKP), which is characterized as high dimension and strong constraint. Initial swar...
详细信息
ISBN:
(纸本)9789881563958
In this paper, a novel improved fruit fly optimization algorithm (IFOA) is proposed for solving the multidimensional knapsack problem (MKP), which is characterized as high dimension and strong constraint. Initial swarms are generated according to the probability vector respectively. After the smell-based searching accomplishing, a repair operator granded on the pseudo-utility ratio, which is calculated by solving the dual problem of linear programming relaxion of MKP, is applied to guarantee the feasibility and enhance the quality of solutions. A swarm reduction strategy is used to balance the searching ability and convergence speed. Numerous tests and comparison with other algorithms based on two sets of benchmark problems demonstrate that IFOA is an efficient algorithm to solve MKP.
Two dimensional strip-packing problem (2DSPP) consists of packing a set of rectangular items on one strip with a restriction of a maximal width and height. Because the conventional algorithms are still sub-optimal, th...
详细信息
Two dimensional strip-packing problem (2DSPP) consists of packing a set of rectangular items on one strip with a restriction of a maximal width and height. Because the conventional algorithms are still sub-optimal, the researchers tend towards searching for more successful alternative algorithms to solve 2DSPP. The fruit fly optimization algorithm (FOA), which is one of the recently proposed meta-heuristic algorithms, has been successfully applied on many engineering and mathematical problems. This study presents an implementation of FOA for solving non-oriented 2DSPP. The aim of the study is to find the optimal sequence of the rectangles in a strip, and then to place the rectangles by bottom left fill approach to have the optimal height within a fixed width box. The experiments are concluded on online available set of 2DSPP test problems. The preliminary results of the study are compared with the results of some conventional or heuristic approaches which use the same problem set. The experimental results show the promising results are obtained by FOA on solving 2DSPPs. (c) 2017 The Authors. Published by Elsevier B.V.
The fruit fly optimization algorithm has drawn various attention to researchers and engineers, due to the simple theory and flexible frame. For solving the complex continuous optimization problems, an improved fruit f...
详细信息
ISBN:
(纸本)9781728165974
The fruit fly optimization algorithm has drawn various attention to researchers and engineers, due to the simple theory and flexible frame. For solving the complex continuous optimization problems, an improved fruitflyalgorithm based on vision scanning search and extensive learning mechanism is proposed in this paper. The vision scanning search strategy is used to scan the potential area by changing the search angle of swarm center. This strategy is utilized to guide the population to jump out the local trap. The extensive learning is using the knowledge of neighboring structure to increase the diversity of population for solving the non-separable issues. Furthermore, a new mutation strategy based on difference vector is proposed to improve the search efficiency of VLFOA. Testified in CEC 2017 benchmark problems, the results show that the VLFOA has a superior performance compared with the original FOA and the state of art variants of the FOA.
As a new optimizationalgorithm, fruit fly optimization algorithm (FOA) attracts a lot of attentions. By analyzing the probability of FOA jumping out of the local optimal range, we verified that FOA is ineffective in ...
详细信息
ISBN:
(纸本)9789881563958
As a new optimizationalgorithm, fruit fly optimization algorithm (FOA) attracts a lot of attentions. By analyzing the probability of FOA jumping out of the local optimal range, we verified that FOA is ineffective in solving complex optimization problems whose optimal solution is nonzero. In order to improve the performance of FOA, a Modified Global fruit fly optimization algorithm (MGFOA) is introduced in this paper. In MGFOA, a uniform mechanism to produce the candidate solution is used to improve the global searching ability, a self-adaptive way to control the flight range is adapted to increase the optimize accuracy, and a ladder growth way of population is introduced to imitate the detection behavior of fruitfly. The experiment on 12 benchmark functions shows that MGFOA is more effective and robust than basic FOA, Global Particle Swarm optimizationalgorithm (GPSO) and another improved FOA (LGMS-FOA).
fruit fly optimization algorithm(FOA) is inspired by imitating the foraging activity of fruit flies. Aiming at its inability to search the entire solution space, a Self-Adaptive Modified fruitflyoptimization Algorit...
详细信息
ISBN:
(纸本)9781538629185
fruit fly optimization algorithm(FOA) is inspired by imitating the foraging activity of fruit flies. Aiming at its inability to search the entire solution space, a Self-Adaptive Modified fruit fly optimization algorithm(SAMFOA) is proposed. Firstly, a new calculation formula of the smell concentration judgment value is designed. With the use of the new formula, the smell concentration judgment value is no longer restricted to be non-negative value so the algorithm is able to search both the positive and negative part of the solution space. Secondly, a self-adaptive osphresis foraging radius is introduced to enhance the ability to break away from local optimum. Experiments on 20 numerical benchmark functions show that the algorithm has good performance in terms of global searching ability, optimize accuracy and stability.
暂无评论