Stochastic Fractal Based Multiobjective Fruit Fly Optimization

The fruit fly optimization algorithm (FOA) is a global optimization algorithm inspired by the foraging behavior of a fruit fly swarm. In this study, a novel stochastic fractal model based fruit fly optimization algorithm is proposed for multiobjective optimization. A food source generating method based on a stochastic fractal with an adaptive parameter updating strategy is introduced to improve the convergence performance of the fruit fly optimization algorithm. To deal with multiobjective optimization problems, the Pareto domination concept is integrated into the selection process of fruit fly optimization and a novel multiobjective fruit fly optimization algorithm is then developed. Similarly to most of other multiobjective evolutionary algorithms (MOEAs), an external elitist archive is utilized to preserve the nondominated solutions found so far during the evolution, and a normalized nearest neighbor distance based density estimation strategy is adopted to keep the diversity of the external elitist archive. Eighteen benchmarks are used to test the performance of the stochastic fractal based multiobjective fruit fly optimization algorithm (SFMOFOA). Numerical results show that the SFMOFOA is able to well converge to the Pareto fronts of the test benchmarks with good distributions. Compared with four state-of-the-art methods, namely, the non-dominated sorting generic algorithm (NSGA-II), the strength Pareto evolutionary algorithm (SPEA2), multi-objective particle swarm optimization (MOPSO), and multiobjective self-adaptive differential evolution (MOSADE), the proposed SFMOFOA has better or competitive multiobjective optimization performance

System Reliability-Redundancy Allocation by Evolutionary Computation

International audienc

Stochastic Fractal Based Multiobjective Fruit Fly Optimization

The fruit fly optimization algorithm (FOA) is a global optimization algorithm inspired by the foraging behavior of a fruit fly swarm. In this study, a novel stochastic fractal model based fruit fly optimization algorithm is proposed for multiobjective optimization. A food source generating method based on a stochastic fractal with an adaptive parameter updating strategy is introduced to improve the convergence performance of the fruit fly optimization algorithm. To deal with multiobjective optimization problems, the Pareto domination concept is integrated into the selection process of fruit fly optimization and a novel multiobjective fruit fly optimization algorithm is then developed. Similarly to most of other multiobjective evolutionary algorithms (MOEAs), an external elitist archive is utilized to preserve the nondominated solutions found so far during the evolution, and a normalized nearest neighbor distance based density estimation strategy is adopted to keep the diversity of the external elitist archive. Eighteen benchmarks are used to test the performance of the stochastic fractal based multiobjective fruit fly optimization algorithm (SFMOFOA). Numerical results show that the SFMOFOA is able to well converge to the Pareto fronts of the test benchmarks with good distributions. Compared with four state-of-the-art methods, namely, the non-dominated sorting generic algorithm (NSGA-II), the strength Pareto evolutionary algorithm (SPEA2), multi-objective particle swarm optimization (MOPSO), and multiobjective self-adaptive differential evolution (MOSADE), the proposed SFMOFOA has better or competitive multiobjective optimization performance

A hybrid Jaya algorithm for reliability–redundancy allocation problems

© 2017 Informa UK Limited, trading as Taylor & Francis Group. This article proposes an efficient improved hybrid Jaya algorithm based on time-varying acceleration coefficients (TVACs) and the learning phase introduced in teaching–learning-based optimization (TLBO), named the LJaya-TVAC algorithm, for solving various types of nonlinear mixed-integer reliability–redundancy allocation problems (RRAPs) and standard real-parameter test functions. RRAPs include series, series–parallel, complex (bridge) and overspeed protection systems. The search power of the proposed LJaya-TVAC algorithm for finding the optimal solutions is first tested on the standard real-parameter unimodal and multi-modal functions with dimensions of 30–100, and then tested on various types of nonlinear mixed-integer RRAPs. The results are compared with the original Jaya algorithm and the best results reported in the recent literature. The optimal results obtained with the proposed LJaya-TVAC algorithm provide evidence for its better and acceptable optimization performance compared to the original Jaya algorithm and other reported optimal results

CFA optimizer: A new and powerful algorithm inspired by Franklin's and Coulomb's laws theory for solving the economic load dispatch problems

Copyright © 2018 John Wiley & Sons, Ltd. This paper presents a new efficient algorithm inspired by Franklin's and Coulomb's laws theory that is referred to as CFA algorithm, for finding the global solutions of optimal economic load dispatch problems in power systems. CFA is based on the impact of electrically charged particles on each other due to electrical attraction and repulsion forces. The effectiveness of the CFA in different terms is tested on basic benchmark problems. Then, the quality of the CFA to achieve accurate results in different aspects is examined and proven on economic load dispatch problems including 4 different size cases, 6, 10, 15, and 110-unit test systems. Finally, the results are compared with other inspired algorithms as well as results reported in the literature. The simulation results provide evidence for the well-organized and efficient performance of the CFA algorithm in solving great diversity of nonlinear optimization problems

Perturbed stochastic fractal search for solar PV parameter estimation

Following the widespread use of solar energy all over the world, the design of high quality photovoltaic (PV) cells has attracted strong research interests. To properly evaluate, control and optimize solar PV systems, it is crucial to establish a reliable and accurate model, which is a challenging task due to the presence of non-linearity and multi-modality in the PV systems. In this work, a new meta-heuristic algorithm (MHA), called perturbed stochastic fractal search (pSFS), is proposed to estimate the PV parameters in an optimization framework. The novelty lies in two aspects: (i) employ its own searching operators, i.e., diffusion and updating, to achieve a balance between the global exploration and the local exploitation; and (ii) incorporate a chaotic elitist perturbation strategy to improve the searching performance. To examine the effectiveness of pSFS, this method is applied to solve three PV estimation problems for different PV models, including single diode, double diode and PV modules. Experimental results and statistical analysis show that the proposed pSFS has improved estimation accuracy and robustness compared with several other algorithms recently developed

Multi-objective System Design Optimization via PPA and a Fuzzy Method

System design deals with various challenges of targets and resources, such as reliability, availability, maintainability, cost, weight, volume, and configuration. This paper deals with the multi-objective system availability and cost optimization of parallel–series systems by resorting to the multi-objective strawberry algorithm also known as the Plant Propagation Algorithm or PPA and a fuzzy method. It is the first implementation of this optimization algorithm in the literature for this kind of problem to generate the Pareto Front. The fuzzy method allows helping the decision maker to select the best compromise solution. A numerical case study involving 10 subsystems highlights the applicability of the proposed approach

Surgical Subtask Automation for Intraluminal Procedures using Deep Reinforcement Learning

Intraluminal procedures have opened up a new sub-field of minimally invasive surgery that use flexible instruments to navigate through complex luminal structures of the body, resulting in reduced invasiveness and improved patient benefits. One of the major challenges in this field is the accurate and precise control of the instrument inside the human body. Robotics has emerged as a promising solution to this problem. However, to achieve successful robotic intraluminal interventions, the control of the instrument needs to be automated to a large extent. The thesis first examines the state-of-the-art in intraluminal surgical robotics and identifies the key challenges in this field, which include the need for safe and effective tool manipulation, and the ability to adapt to unexpected changes in the luminal environment. To address these challenges, the thesis proposes several levels of autonomy that enable the robotic system to perform individual subtasks autonomously, while still allowing the surgeon to retain overall control of the procedure. The approach facilitates the development of specialized algorithms such as Deep Reinforcement Learning (DRL) for subtasks like navigation and tissue manipulation to produce robust surgical gestures. Additionally, the thesis proposes a safety framework that provides formal guarantees to prevent risky actions. The presented approaches are evaluated through a series of experiments using simulation and robotic platforms. The experiments demonstrate that subtask automation can improve the accuracy and efficiency of tool positioning and tissue manipulation, while also reducing the cognitive load on the surgeon. The results of this research have the potential to improve the reliability and safety of intraluminal surgical interventions, ultimately leading to better outcomes for patients and surgeons