Search

This paper discusses the process of optimizing the shape of systems that are controlled by the Stokes flow with threshold leak boundary conditions. In the theoretical part it focuses on studying the stability of solutions to the state problem in relation to a specific set of domains. In order to facilitate computation, the slip term and impermeability condition are regulated. In the computational part, the optimized portion of the boundary is defined using Bézier polynomials, in order to create a finite dimensional optimization problem. The paper also includes numerical examples to demonstrate the computational efficiency of this approach. [ABSTRACT FROM AUTHOR]

This paper introduces the Gooseneck Barnacle Optimisation Algorithm (GBO) as a novel evolutionary method inspired by the natural mating behaviour of gooseneck barnacles, which involves sperm casting and self-fertilization. GBO is mathematically modelled, considering the hermaphroditic nature of these microorganisms that have thrived since the Jurassic period. In contrast to the previously published Barnacle Mating Optimizer (BMO) algorithm, GBO more accurately captures the unique static and dynamic mating behaviours specific to gooseneck barnacles. The algorithm incorporates essential factors, such as navigational sperm casting properties, food availability, food attractiveness, wind direction, and intertidal zone wave movement during mating, creating two vital optimization stages: exploration and exploitation. Real-world case studies and mathematical test functions serve as qualitative and quantitative benchmarks. The results demonstrate that GBO outperforms well-known algorithms, including the previous BMO, by effectively improving the initial random population for a given problem, converging to the global optimum, and producing significantly better optimization outcomes. • Proposed Gooseneck Barnacle Optimizer mimics gooseneck barnacles' mating behaviour. • Inspiration: sperm casting, wind direction, intertidal wave action during mating. • Address the issues with original Barnacle Mating Optimizer. • Standard benchmark functions evaluate GBO's performance. • Hybridize with Least Square Support Vector Machine for real time-series forecasting. [ABSTRACT FROM AUTHOR]

This paper presents a localization task for a robot swarm guided by the RAOI behavioral rules (repulsion, attraction, orientation, and influence). Slight changes in these parameters can significantly affect the task's performance. To address this challenge, we have developed a swarm simulator incorporating the robots' dynamic model. The localization task is evaluated using objective functions, represented as metrics, which are minimized using multi-objective optimization techniques. Our results showcase the Pareto fronts, illustrating how the objective functions react to variations in the RAOI parameters, aiming to expedite target localization while maintaining the swarm's integrity. • Repulsion, Attraction, Orientation, and Influence parameters (RAOI) are proposed. • We steer a swarm of robots through RAOI parameters to solve collective tasks. • Swarm efficiency depends on simulations and satisfies several objective functions. • Pareto fronts visualize the interaction of objective functions with RAOI parameters. • Results highlight the potential applicability of these methods in swarm tasks. [ABSTRACT FROM AUTHOR]

Constrained integer stochastic optimization problems (CISOP) are optimization problems where the cost function is stochastic and the constraints are deterministic. Solving the CISOP using conventional optimization techniques is time-consuming when the design space is huge. Ordinal optimization offers an efficient technique suitable for solving the CISOP. In this paper, an approach that uses golden jackal optimization assisted by ordinal optimization (GJOO) is developed for resolving the CISOP in a relatively short time. The GJOO is composed of three phases: metamodel, global search, and ranking and selection. At first, the polynomial chaos expansion is used as a metamodel to rapidly assess a solution. Next, advanced golden jackal optimization is adopted to determine N excellent solutions from the entire design space. At last, the modified optimal computing budget allocation is adopted to determine a distinguished solution from the N excellent solutions. The GJOO is utilized to the shipping/receiving docks optimization problem of a container freight station in air cargo. The performances of the GJOO are compared with those of five meta-heuristic methods. Empirical results demonstrate the efficiency and robustness of the GJOO algorithm. [ABSTRACT FROM AUTHOR]

In this paper, the Inner–Outer Direct Search (IODS) optimization technique is extended in the fuzzy environment to solve a fuzzy system of nonlinear equations. The proposed approach of fuzzy IODS converts the fuzzy system of nonlinear equations to an unconstrained fuzzy optimization problem. Then, the unconstrained fuzzy optimization problem is studied through the IODS technique. To validate the proposed algorithm, convergence analysis is performed. Further, three different fuzzy system of nonlinear equations are considered to demonstrate the algorithm. The fuzzy system of nonlinear equations is divided into various cases viz. fully fuzzy (when both the coefficient matrix and right-side vector are fuzzy) and only fuzzy (when either of the coefficient matrix or the right-side vector is fuzzy). For each individual case the numerical and graphical convergence of the obtained solutions were established. One electrical circuit problem is investigated to obtain the current in fuzzy environment and the same is compared with an existing method. It is observed that the closed form of the fuzzy solution contains the solution of the corresponding crisp system as well as the compared method. Finally, it can be noted that the proposed IODS approach can be applied to find the united fuzzy solutions for various science and engineering problems with easy implementation. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm twice optimization for interval type-2 fuzzy neural networks with asymmetric membership functions (TOIT2FNN-AMF), for nonlinear system identification problems. The proposed TOIT2FNN-AMF uses an asymmetric Gaussian interval type-2 membership function to enhance the network's ability to describe and solve nonlinear and uncertain problems. The twice optimization algorithm consists of structure learning and parameter learning. Firstly, this paper proposes a multi-strategy adaptive differential evolution (MSADE) algorithm as the first optimization algorithm, which is used to determine the structure and the initial values of the parameters of the TOIT2FNN-AMF. It applies the root mean square error (RMSE) of the TOIT2FNN-AMF as the fitness function to determine the structure (number of rules) and initial parameters of the IT2FNN by searching for the RMSE values under different structures. When the fitness value reaches the minimum, that is, the RMSE value of the TOIT2FNN-AMF, the corresponding number will become the optimal one of fuzzy rules of the TOIT2FNN-AMF. Then, the second optimization algorithm of the TOIT2FNN-AMF turns into a hybrid optimization algorithm composed of an adaptive moment estimation (Adam) algorithm and recursive least squares (RLS) algorithm. Adam is used to optimize the antecedent parameters of TOIT2FNN-AMF rules, so as to maintain rapid convergence without generating oscillation during the training process; RLS is used to optimize the consequent parameters of TOIT2FNN-AMF rules, so that the network parameters can be optimized rapidly. In this way, the problems of excessive parameters to be adjusted and excessive slow convergence of the network can be solved. Finally, this paper evaluates the proposed TOIT2FNN-AMF by testing on problems of nonlinear system identification and chaotic time-series prediction. The simulation results are compared with those of similar methods in the existing literatures, which demonstrates that the proposed TOIT2FNN-AMF model yields a lower RMSE value and a simpler network structure than the other type-2 fuzzy neural networks (T2FNNs). [ABSTRACT FROM AUTHOR]

Stochastic configuration networks (SCNs) have universal approximation capability and fast modeling properties, which have been successfully employed in large-scale data analytics. Based on SCNs, Stochastic configuration networks with block increments (BSC) use the node block increments mechanism to improve training speed but increase the complexity of the model. This paper presents a parallel configuration method (PCM), develops an extension of the original BSC with chaos theory and proposes stochastic configuration networks with chaotic maps (SCNCM), and establishes a hierarchical learning strategy (HLS) to enhance the compactness and construction speed of the model. Firstly, PCM randomly assigns the input weights w and biases b of hidden layer nodes by using uniform and normal distributions. In PCM, an iterative learning algorithm is intended to generate the scope control set and improve configuration efficiency. Secondly, the paper presents two kinds of stochastic configuration networks with chaotic maps, which are SCNCM-I and SCNCM-II. SCNCM-I adjusts block size by using multiple error values and chaotic maps to improve the training speed. Based on SCNCM-I, SCNCM-II utilizes node removal mechanism to enhance the compactness. Finally, HLS integrates with SCNCM-I, SCNCM-II, and the Harris-hawks optimization algorithm (HHO). The purpose of training is to enhance the training speed and compactness for three algorithms. The experiments are conducted on four benchmark data sets and an industrial application shows its effectiveness. [ABSTRACT FROM AUTHOR]

Purpose: Supply chains (SCs) have been growingly virtualized in response to the market challenges and opportunities that are presented by new and cost-effective internet-based technologies today. This paper designed a virtual closed-loop supply chain (VCLSC) network based on multiperiod, multiproduct and by using the Internet of Things (IoT). The purpose of the paper is the optimization of the VCLSC network. Design/methodology/approach: The proposed model considers the maximization of profit. For this purpose, costs related to virtualization such as security, energy consumption, recall and IoT facilities along with the usual costs of the SC are considered in the model. Due to real-world demand fluctuations, in this model, demand is considered fuzzy. Finally, the problem is solved using the Grey Wolf algorithm and Firefly algorithm. A numerical example and sensitivity analysis on the main parameters of the model are used to describe the importance and applicability of the developed model. Findings: The findings showed that the Firefly algorithm performed better and identified more profit for the SC in each period. Also, the results of the sensitivity analysis using the IoT in a VCLSC showed that the profit of the virtual supply chain (VSC) is higher compared to not using IoT due to tracking defective parts and identifying reversible products. In proposed model, chain members can help improve chain operations by tracking raw materials and products, delivering products faster and with higher quality to customers, bringing a new level of SC efficiency to industries. As a result, VSCs can be controlled, programmed and optimized remotely over the Internet based on virtual objects rather than direct observation. Originality/value: There are limited researches on designing and optimizing the VCLSC network. This study is one of the first studies that optimize the VSC networks considering minimization of virtual costs and maximization of profits. In most researches, the theory of VSC and its advantages have been described, while in this research, mathematical optimization and modeling of the VSC have been done, and it has been tried to apply SC virtualization using the IoT. Considering virtual costs in VSC optimization is another originality of this research. Also, considering the uncertainty in the SC brings the issue closer to the real world. In this study, virtualization costs including security, recall and energy consumption in SC optimization are considered. Highlights: Investigates the role of IoT for virtual supply chain profit optimization and mathematical optimization of virtual closed-loop supply chain (VCLSC) based on multiperiod, multiproduct with emphasis on using the IoT under uncertainty. Considering the most important costs of virtualization of supply chain include: cost of IoT information security, cost of IoT energy consumption, cost of recall the production department, cost of IoT facilities. Selection of the optimal suppliers in each period and determination of the price of each returned product in virtual supply chain. Solving and validating the proposed model with two meta-heuristic algorithms (the Grey Wolf algorithm and Firefly algorithm). [ABSTRACT FROM AUTHOR]

In this paper, an enhanced hybrid chameleon swarm algorithm (CSA) is proposed and applied to the degree reduction problem of disk Wang–Ball (DWB) curve. CSA is a novel population-based algorithm inspired by the hunting behavior of chameleons, its simplicity and easy implementation make it applied to different fields. However, it suffers from premature convergence and easy to fall into local optimum, especially in the face of complex optimization problems. Therefore, this paper proposes an enhanced hybrid CSA (CCECSA, for short). Compared with the classic CSA, the proposed CCECSA mainly introduces three improvements: (1) The crisscross optimization algorithm is mixed to avoid premature convergence, in which the horizontal and vertical crossover can generate moderation solutions to increase the diversity of the population. (2) Elite guidance mechanism is introduced to speed up the convergence. (3) Competitive substitution mechanism is added to replace the worst individual, and an interference strategy is set to prevent the algorithm from falling into a local optimum. The efficiency and robustness of the proposed CCECSA are demonstrated by the comparison results with some advanced meta-heuristic algorithms on CEC2014, CEC2017, and 4 engineering design examples. In addition, for the degree reduction problem of DWB curves, the multi-degree reduction optimization models of its center curve and radius function are established respectively. At the same time, the optimal center curve and radius function of the approximating DWB curves of lower degree are obtained by the proposed CCECSA. The experimental results show that the proposed CCECSA achieves the optimal solution with better convergence and robustness. The source code of CCECSA is publicly available in the supplementary material related to this article. [ABSTRACT FROM AUTHOR]

Purpose: Novel aircraft propulsion configurations require a greater integration of the propulsive system with the airframe. As a consequence of the closer integration of the propulsive system, higher levels of flow distortion at the fan face are expected. This distortion will propagate through the fan and penalize the system performance. This will also modify the exhaust design requirements. This paper aims to propose a methodology for the aerodynamic optimization of the exhaust for novel embedded propulsive systems. To model the distortion transfer, a low order throughflow fan model is included. Design/methodology/approach: As the case study a 2D axisymmetric aft-mounted annular boundary layer ingestion (BLI) propulsor is used. An automated computational fluid dynamics approach is applied with a parametric definition of the design space. A throughflow body force model for the fan is implemented and validated for 2D axisymmetric and 3D flows. A multi-objective optimization based on evolutionary algorithms is used for the exhaust design. Findings: By the application of the optimization methodology, a maximum benefit of approximately 0.32% of the total aircraft required thrust was observed by the application of compact exhaust designs. Furthermore, for the embedded system, it is observed that the design of the compact exhaust and the nacelle afterbody have a considerable impact on the aerodynamic performance. Originality/value: This paper presents a novel approach for the exhaust design of embedded propulsive systems in novel aircraft configurations. To the best of the authors' knowledge, this is the first detailed optimization of the exhaust system on an annular aft-mounted BLI propulsor. [ABSTRACT FROM AUTHOR]

Whale optimization algorithm (WOA), as an advanced optimization algorithm with simple structure, has been favored by various fields. However, there are some disadvantages of WOA, such as slow convergence speed, low precision and falling into local optimal value easily. In this paper, a novel improved whale optimization algorithm (IWOA) with multi-strategy and hybrid algorithm is proposed to overcome above shortcomings. Firstly, IWOA initializes the population by chaotic mapping to avoid the initial population distribution of WOA deviating from the optimal value. Secondly, IWOA combines the pheromone of the black widow algorithm and the opposition-based learning strategy to modify the population, which improves the convergence speed and the global performance of WOA respectively. Finally, the adaptive coefficients and the new update modes replace the original update modes, which makes the structure of WOA simpler and more accurate. In addition, the convergence of IWOA is also proved in this paper. On the one hand, to demonstrate the effectiveness of IWOA, 23 benchmark functions are used to test various performance of the algorithm. On the other hand, in order to prove the superiority of IWOA, the experimental results are compared and analyzed with other optimization algorithms. Simulation results show that IWOA proposed in this paper owns excellent performance in convergence speed, stability, accuracy and global performance, compared with other algorithms. [ABSTRACT FROM AUTHOR]

A time minimization transportation problem deals with the resource efficiency to minimize time taken by the transport systems to deliver the commodity from sources to destinations. In this paper, a two-level time minimization transportation problem has been considered that categorizes the source–destination links into Level-I and Level-II with respect to the higher and lower level priority. The optimal delivery schedule of Level-I is followed up with the same for the Level-II cells. The paper proposes a solution procedure consisting of new algorithms that have been hybridized within the Particle Swarm Optimization to solve the problem making efficient use of resources. The solution procedure provides a methodical approach to the transport enterprises.This procedure does away with the rigid constraints, such as the location and number of non-zero allocations, required to be met by the traditional techniques of solving the transportation problem. The procedure generates pairs of Level-I and Level-II times at each iteration and the best pair(s) amongst these is/are marked out as the optimal solution of the problem. The solution procedure is explained through a numerical illustration. [ABSTRACT FROM AUTHOR]

Limitations of the standard backstepping control technique are overcome in this paper by yielding global conditions for regional ones; specifically, flexible cascade arrangements that do not require the system to be put in a pure- or strict-feedback form to ensure controllability beforehand, handling of nonlinear MIMO blocks without invertible input distribution matrices, calculation of virtual and real control laws regardless of the non-affine-in-control nature of subsystems, and systematic numerical synthesis of Lyapunov-based control laws at each step of the cascade connection via linear matrix inequalities. All these benefits derive from exploiting exact convex rewriting of nonlinear terms, splitting available and non-available signals for control implementation, and applying the direct Lyapunov method to cast conditions as a convex optimization problem. Examples of academic and practical interest illustrate the advantages of the novel methodology over former approaches. [ABSTRACT FROM AUTHOR]

This paper studies model predictive security control (MPSC) for networked switched systems under denial-of-service (DoS) attacks. Most of existing works only adjust the triggering scheme when being attacked. Different from them, this paper proposes a novel timing-response event-triggering scheme (TR-ETS) to reduce the impact of attacks on system performance, which can not only configure system resources adaptively, but also accurately detect attack information and compensate the attacked data. Specifically, the proposed scheme includes two event-based triggers, which can dynamically and jointly regulate the communication/calculation ability, generate virtual attack sequences and acquire the number of passive packet loss. Then, based on the triggered states, a class of model predictive controllers is designed to optimize the control action. Due to possible strong attacks, a security control framework including network and local loops be introduced and a permissable type-switching mechanism (PTM) is used. Under the permissable controllers (i.e., network and local controllers), sufficient conditions for the stability of closed-loop switched systems are derived. In addition, a set of model predictive optimization algorithm using linear matrix inequalities (LMIs) technique is addressed. Finally, the effectiveness of the proposed method is verified by illustrative examples. [ABSTRACT FROM AUTHOR]

In this paper, the problem of observer-based model predictive control (MPC) for a multi-channel cyber-physical system (CPS) with uncertainties and hybrid attacks is investigated via interval type-2 Takagi-Sugeno (IT2 T-S) fuzzy model. Both denial-of-service (DoS) and false data injection (FDI) attacks are studied due to the vulnerability of wireless transmission channels. The objective of the addressed problem is to improve the security performance of the multi-channel CPS under malicious attacks, which has not been adequately investigated in the existing MPC algorithms. Moreover, uncertainties which appear not only in the membership functions but in both state and input matrices are considered. In this paper, different from the method that FDI attacks are handled by the bounded functions, an off-line observer is designed to actively defend against the FDI attacks. Meanwhile, an on-line MPC optimization algorithm, which minimizes the upper bound of objective function respecting input constraints, is presented to obtain the secure controller gains. Finally, an illustrative example is provided to verify the effectiveness and superiority of presented approach. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this study is to decrease the computation time that the large number of simulations involved in a parametric sweep when the model is in a three-dimensional environment. Design/methodology/approach: In this paper, a new methodology combining the PCE and a controlled, elitist genetic algorithm is proposed to design IPT systems. The relationship between the quantities of interest (mutual inductance and ferrite volume) and structural parameters (ferrite dimensions) is expressed by a PCE metamodel. Then, two objective functions corresponding to mutual inductance and ferrite volume are defined. These are combined together to obtain optimal parameters with a trade-off between these outputs. Findings: According to the number of individuals and the generations defined in the optimization algorithm in this paper, it needs to calculate 20,000 times in a 3D environment, which is quite time-consuming. But for PCE metamodel of mutual inductance M, it requires at least 100 times of calculations. Afterward, the evaluation of M based on the PCE metamodel requires 1 or 2 s. So compared to a conventional optimization based on the 3D model, it is easier to get optimized results with this approach and it saves a lot of computation time. Originality/value: The multiobjective optimization based on PCEs could be helpful to perform the optimization when considering the system in a realistic 3D environment involving many parameters with low computation time. [ABSTRACT FROM AUTHOR]

Purpose: The paper aims to deal with the exact computation of the Jacobian of a time criteria from a numerical simulation of power electronics structures, for the sizing by gradient-based optimization algorithm. Design/methodology/approach: Runge Kutta 44 is used to solve the state equations. The generic approach combines numerical and symbolic approaches. The modelling of the static converter is based on ideal switches. Findings: The paper extends the state equations to derivate any state variable according a sizing parameter. The integral expressions used for some sizing performances (e.g. average or RMS values) mix symbolic and numerical approaches. Choices are made for the derivatives of the extrema of which the search is not a continuous process. The use of an object-oriented implementation allows to have generic formulation of some design performances. Research limitations/implications: The paper aims to propose and to test formulations of sizing criteria and their gradients; so, the modelling of the study case is carried out manually. Due to generic modelling approach used for the power electronics, the model is not completely continuous. So, the derivatives according some parameters (e.g. switch controls) must be carried out by finite differences. However, as the global behaviour is continuous, it is not critical. Practical implications: The proposed formulations can be easily applied on simple static converter applications. For applications with large state equations, it should be possible to use the basic model of switches used in simulation tools of power electronics. The solving process and the sizing criteria formulation (with their derivatives) are generic and can be instantiate for any study. Originality/value: The approach proposes formulations giving a numerical sizing dynamic model with a Jacobian computed, if possible, by an exact derivation useful for optimization studies. The approach gives fast simulation and fast computation of the derivatives by combining numerical and analytical approaches. [ABSTRACT FROM AUTHOR]

This paper introduces the Ulimisana Optimisation Algorithm enabled Population Based Training (PBT-UOA) framework which allows for hyperparameters to be fine-tuned using a population based meta-heuristic algorithm at the same time as parameters are being optimised. Models are trained until near-convergence on the updated hyperparameters and the parameters of the best performing model are shared to warm start the other models in the next hyperparameter tuning iteration. In the PBT-UOA, all models are trained using the same dataset. This framework performed better than the Bayesian Optimisation algorithm. This paper also introduces the Ulimisana Optimisation Algorithm enabled Federated Learning (FL-UOA) framework which is an extension of the PBT-UOA. This framework is introduced to address the challenges of scattered datasets and privacy that is presented by the increase in connected end-devices. The FL-UOA learns on local data in scattered end-devices without sending datasets to a central server. The training datasets in local end-devices are used to evaluate models trained in other end-devices. The performance metrics are used to update the Social Trust Network (STN) of the FL-UOA framework. The FL-UOA outperformed the classic Federated Learning framework. This STN updating technique was tested in Machine Learning (ML) Unfairness to see how well it functioned as a regularisation term. This was achieved by training different models on subsets that contained datasets representing only specific sensitive groups. Results showed that by updating the hyperparameters while learning the parameters on the dataset scattered across different devices, the FL-UOA, takes advantage of diversified learning and reduces the ML Unfairness for models trained on group specific datasets. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms (EAs) that integrate niching techniques are among the most effective methods for multimodal optimization problems. However, most algorithmic contributions are based on empirical performance observations rather than rigorous mathematical convergence support; this makes most existing methods parameter sensitive. Inspired by a recently proposed deterministic global optimization method, granular sieving (GrS), an extended global optimization method named collaborative GrS (Co-GrS) and a novel deterministic multi-EA design framework are proposed in this paper. The innovations are threefold. (1) Existing EAs are stochastic methods, and this paper introduces the principle of deterministic global optimization into EA for the first time in the literature. (2) A deterministic multi-EA framework is designed and implemented in the paper; from the perspective of population evolution, an easy-to-operate survival-of-the-fittest strategy based on mathematical principles is established in Co-GrS. (3) Unlike existing stochastic EAs, where the reproducibility of optimal solutions is achieved in a statistical sense, Co-GrS does not involve random parameters, and it automatically runs the algorithm only once with pre-set fixed parameters to find all optimal solutions. The experimental results demonstrate the effectiveness and competitiveness of our method compared to 16 state-of-the-art multimodal algorithms on the CEC'2013 benchmark suite. [ABSTRACT FROM AUTHOR]

Purpose: In the vast majority of published papers, the optimal allocation of photovoltaic distributed generation (PVDG) units and reconfiguration problems are proposed along with the number of PVDG used in the simulation. However, optimisation without selecting the number of PVDG units installed in the distribution grid is insufficient to achieve a better operational performance of power systems. Moreover, multi-objective installation of PVDG units and reconfiguration aims to simultaneously relieve congestion problems, improve voltage profile and minimise the active and reactive power losses. Therefore, this paper aims to propose a new modified camel algorithm (NMCA) to solve multi-objective problems considering radial distribution system to achieve secure and stable operation of electric power system with good performance. Design/methodology/approach: In this paper, the decision variables include the location and size of PVDG units with specific rang to determine the number of PVDG units needed to install and open network lines determined using NMCA based on the L_∞ technique. This also satisfies the operating and radial constraints. Furthermore, a benchmark comparison with different well known optimisation algorithms has been made to confirm the solutions. Finally, an analysis of the findings was conducted, and the feasibility of solutions was fully verified and discussed. Findings: Two test systems – the institute of electrical and electronics engineers (IEEE) 33-bus and IEEE 69-bus, were used to examine the accuracy and effectiveness of the proposed algorithm. The findings obtained amply proved the efficiency and superiority of the NMCA algorithm over the other different optimisation algorithms. Originality/value: The proposed approach is applied to solve the installation PVDG unit's problem and reconfiguration problem in the radial distribution system, satisfying the operating and radial constraints. Also, it minimises active and reactive power losses and improves voltage profile. [ABSTRACT FROM AUTHOR]

Purpose: The distributed generation (DG) proper placement is an extremely rebellious concern for attaining their extreme potential profits. This paper aims to propose the application of the communal spider optimization algorithm (CSOA) to the performance model of the wind turbine unit (WTU) and photovoltaic (PV) array locating method. It also involves the power loss reduction and voltage stability improvement of the ring main distribution system (DS). Design/methodology/approach: This paper replicates the efficiency of WTU and PV array enactment models in the placement of DG. The effectiveness of the voltage stability factor considered in computing the voltage stability levels of buses in the DS is studied. Findings: The voltage stability levels are augmented, and total losses are diminished for the taken bus system. The accomplished outcomes exposed the number of PV arrays accompanied by the optimal bus location for various penetration situations. Practical implications: The optimal placement and sizing of wind- and solar-based DGs are tested on the 15- and 69-test bus system. Originality/value: Moreover, the projected CSOA algorithm outperforms the PSOA, IAPSOA, BBO, ACO and BSO optimization techniques. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to deal with the design optimization of a synchronous reluctance machine to be used in an X-ray tube, where the goal is to maximize the torque while keeping low the amount of material used, by means of gradient-based free-form shape optimization. Design/methodology/approach: The presented approach is based on the mathematical concept of shape derivatives and allows to obtain new motor designs without the need to introduce a geometric parametrization. This paper presents an extension of a standard gradient-based free-form shape optimization algorithm to the case of multiple objective functions by determining updates, which represent a descent of all involved criteria. Moreover, this paper illustrates a way to obtain an approximate Pareto front. Findings: The presented method allows to obtain optimal designs of arbitrary, non-parametric shape with very low computational cost. This paper validates the results by comparing them to a parametric geometry optimization in JMAG by means of a stochastic optimization algorithm. While the obtained designs are of similar shape, the computational time used by the gradient-based algorithm is in the order of minutes, compared to several hours taken by the stochastic optimization algorithm. Originality/value: This paper applies the presented gradient-based multi-objective optimization algorithm in the context of free-form shape optimization using the mathematical concept of shape derivatives. The authors obtain a set of Pareto-optimal designs, each of which is a shape that is not represented by a fixed set of parameters. To the best of the authors' knowledge, this approach to multi-objective free-form shape optimization is novel in the context of electric machines. [ABSTRACT FROM AUTHOR]

Proximal policy optimization (PPO) algorithm is a deep reinforcement learning algorithm with outstanding performance, especially in continuous control tasks. But the performance of this method is still affected by its exploration ability. Based on continuous control tasks, this paper analyzes the original Gaussian action exploration mechanism in PPO algorithm, and clarifies the influence of exploration ability on performance. Afterward, aiming at the problem of exploration, an exploration enhancement mechanism based on uncertainty estimation is designed in this paper. Then, we apply exploration enhancement theory to PPO algorithm and propose the proximal policy optimization algorithm with intrinsic exploration module (IEM-PPO). In the experimental parts, we evaluate our method on multiple tasks in MuJoCo phsysical simulator, and compare IEM-PPO algorithm with PPO and PPO with intrinsic curiosity module (ICM-PPO). The experimental results demonstrate that IEM-PPO algorithm performs better in terms of sample efficiency and cumulative reward, and has stability and robustness. [ABSTRACT FROM AUTHOR]

This paper proposes an adaptive dynamic multiobjective optimization algorithm for handling dynamic multiobjective optimization problems with variable environmental change types. Most of the existing dynamic multiobjective optimization problems (DMOPs) only deal with a single change type in the environment. Therefore, we design a set of DMOPs that has variable and mixed change types. Next, this paper proposes an adaptive dynamic multiobjective optimization algorithm (DMOA) focusing on the change types, to solve DMOPs with variable change types. It can detect the different types of environmental changes. The main purpose of a DMOA is to find the Pareto-optimal set (PS) of each environment. Therefore, the change types of DMOPs mainly contain two categories: PS changes over time and PS remains constant. After detecting the change type, an adaptive response strategy is activated to react to environmental changes. If PS changes over time, a classification prediction (CP) strategy is active to respond to environmental changes. If PS remains constant, a dynamic mutation (DM) strategy works to react to environmental changes. The proposed algorithm is extensively studied through comparison with several advanced DMOAs, thereby demonstrating its effectiveness in working out complex DMOPs with variable change types and on the parameter-tuning problem of PID controllers for dynamic systems. [ABSTRACT FROM AUTHOR]

This paper considers the distributed prescribed-time optimization problem of multi-agent systems (MASs). Considering the strongly convex function of time-invariant for each agent, the two-stage distributed prescribed-time optimization algorithm is designed based on the idea of zero-gradient-sum. Meanwhile, in order to save system resources, the event-triggered control mechanism is introduced into the algorithm in this paper. In the first stage, the distributed prescribed-time event-triggered algorithm is proposed to minimize the local objective functions of each agent at the prescribed-time interval. In the second stage, the algorithm is driven to optimize the global cost function while maintaining the gradient sum of all local cost functions to zero. The criteria for achieving the consensus and optimization of MASs are obtained by using Lyapunov stability theory and optimization theory. Moreover, it is proved in detail that using the two triggering functions will not result in Zeno behavior. The numerical example is given to demonstrate the correctness of the theoretical analysis and the effectiveness of the control algorithms. [ABSTRACT FROM AUTHOR]

This paper considers the reliability analysis and the bi-objective optimal problem for a redundant system with two dependent failures: common cause failure (CCF) and load-sharing failure, where the system contains N active components, W warm standbys and C cold standbys, a K -mixed redundancy strategy is considered. In the system, there is a repair team providing variable repair rates according to differential situations: when there are standby components available in the system, the repair team assigns a regular repairman to repair the failed components, with the known fact that regular repairman is not as skilled as an expert repairman in doing some complex repair; when all the spares are exhausted, the repair team assigns an expert repairman to attend failed components; when the system breaks down due to a CCF's occurrence, the repair team provides a very special repair service to restore the system to normal working state. The steady-state distribution of the system is obtained by matrix-analytic method. The sets of equations satisfied by the reliability functions and transient availabilities from arbitrary initial state are respectively presented and solved by Markov renewal theory, Laplace–Stieltjes transform (LST) and Laplace transform (LT) technique. Based on the obtained results, sensitivity analysis is performed by some numerical experiments. From economic view point, the bi-objective optimization problem is constructed and solved by NSGA-II algorithm for the minimal expected total cost and maximal availability. [ABSTRACT FROM AUTHOR]

[Display omitted] • A framework is proposed for population-based optimization algorithms' convergence. • DIRECT's partition and population evolutions are repeated in this framework. • The global convergence of the framework is proved. • Framework is applied successfully on three population-based optimization algorithms. Population-based optimization algorithms, such as genetic algorithm and particle swarm optimization, have become a class of important algorithms for solving global optimization problems. However, there is an issue that the global convergence is often absent for most of them. This paper proposes a partition-based convergence framework for population-based optimization algorithms to solve this troubling problem. In this framework, regular partitions and evolutions of populations are implemented alternatively. Specifically, the initial population is generated from a regular partition on the search space; after several generations of evolution of the population, the evolution result is returned to join in the regular partition again, and a new population is generated. Repeat such progress until some stop condition is satisfied. Global convergence is guaranteed for the framework. Then this convergence framework is applied to particle swarm optimization, differential evolution, and genetic algorithm. The modified algorithms are globally convergent and perform better than the original version. [ABSTRACT FROM AUTHOR]

Multiple-swarm approach is a quite successful evolutionary computation framework for multi-objective particle swarm optimization algorithm (MOPSO) to solve multi-objective optimization problems (MOPs). However, the main challenge of using this framework lies in the lack of leader selection, resulting in the optimal solutions being distributed loosely, as well as far away from the true Pareto-optimal front. To overcome this problem, a multi-swarm MOPSO with an adaptive multiple selection strategy (MOPSO-AMS) is investigated in this paper. This proposed MOPSO-AMS is able to guide each swarm with a suitable leader to improve the evolutionary performance. The novelties and advantages of MOPSO-AMS include the following three aspects. First, a hierarchical evolutionary state detection mechanism, based on the distribution and dominance information of non-dominated solutions, is designed to obtain the evolutionary state of current iteration. Then, the requirements of evolutionary process can be detected. Second, an adaptive multiple selection strategy, using the evolutionary state information and spatial features of candidate solutions, is developed to select leaders of sub-swarms in multiple evolutionary states. Then, suitable leaders can be selected to keep the balance between convergence and diversity. Third, an adaptive parameter adjustment mechanism, based on the dominance relationship of each particle, is introduced to further improve the evolutionary performance of MOPSO-AMS. Finally, numerical simulations and a practical application are used to validate the analytical results and demonstrate the significant improvement of MOPSO-AMS. [ABSTRACT FROM AUTHOR]

In this paper, a new many-objective optimization evolutionary algorithm (MaOEA), namely Many-Objective Evolutionary Algorithm Based on Spatial Distance and Decision Vector Self-Learning (DVSLEA), is proposed for many-objective optimization. The core idea of the algorithm is to use spatial distance to influence the value of disturbance ratio and then affect the generation of offspring. In order to make the algorithm have a good distribution, distribution vector is introduced for the procedure of disturbance. Moreover, a self-learning process is corporated to ascertain the value of disturbance ratio. To evaluate the performance of DVSLEA, the DTLZ and WFG test suites with 3, 5, 8, 10, and 15 objectives are adopted. The experimental results indicate that DVSLEA shows superior performance over nine competitive evolutionary algorithms(MOEA/DD, NSGA-III, VaEA, SPEA2, SPEA2-SDE, MOEADAWA, onebyoneEA, PREA, RVEA), when solving most of the test problems used. [ABSTRACT FROM AUTHOR]

The whale optimization algorithm (WOA) is inspired by humpback whales' bubble-net assaulting mechanism and imitates behaviors such as shrinking and enveloping prey, spiral bubble-net assaulting prey, and variational searching for prey to determine the best solution. However, the basic WOA has the disadvantages of low computation precision, slow convergence rate and easily falling into search stagnation. To strengthen the optimization quality and search reliability, this paper presents a distinctive complex-valued encoding WOA (CWOA) to satisfy the function optimization and engineering design. The complex-valued methodology utilizes a diploid structure to encode individual whales, and the real and imaginary components are added to the basic WOA to revise the position of each humpback whale, which converts the two-dimensional encoding area to a one-dimensional expression area and utilizes the real and imaginary components to illustrate a feasible solution with inherent parallelism. This methodology enriches the population diversity, furthers the individual information, elevates the general search ability, avoids premature convergence and promotes convergence efficiency. The CWOA not only utilizes the characteristics of the complex-valued methodology to avoid slipping into local optima but also exhibits excellent adaptability and robustness to determine the accurate value. Sixteen benchmark test functions and eight engineering designs are used to verify the applicability and practicability of the CWOA. The experimental results demonstrate that the optimization productivity and search performance of the CWOA are superior to those of other algorithms. In addition, the CWOA is a more successful and efficacious method that completely stabilizes exploration and exploitation to establish a quicker convergence rate, higher computation precision, greater resilience and stability. [ABSTRACT FROM AUTHOR]

With the ubiquitous of GPS-equipped devices, spatial crowdsourcing (SC) technology has been widely utilized in our daily life. As a novel computing paradigm, it hires mobile users as workers who physically move to the location of the task and perform the task. Task assignment is a fundamental issue in SC. In real life, there are many complex tasks requiring different workers, among which the quality of worker cooperation and the price satisfaction of users should not be ignored. Hence, this paper examines a satisfaction-aware task assignment (SATA) problem with the goal of maximizing overall user satisfaction, where the user satisfaction integrates the satisfaction towards price and cooperation quality. The SATA problem has been proved to be NP-hard by reducing it from the k -set packing problem. In addition, two algorithms, namely, conflict-aware greedy (CAG) algorithm and game theoretic (GT) algorithm with an optimization strategy, are proposed for solving the SATA problem. The CAG algorithm can efficiently obtain a result with provable approximate bound, while the GT algorithm is proven to be convergent which can find a Nash equilibrium. Extensive experiments have demonstrated the effectiveness and efficiency of our proposed approaches on both real and synthetic datasets. [ABSTRACT FROM AUTHOR]

With the ubiquitous of GPS-equipped devices, spatial crowdsourcing (SC) technology has been widely utilized in our daily life. As a novel computing paradigm, it hires mobile users as workers who physically move to the location of the task and perform the task. Task assignment is a fundamental issue in SC. In real life, there are many complex tasks requiring different workers, among which the quality of worker cooperation and the price satisfaction of users should not be ignored. Hence, this paper examines a satisfaction-aware task assignment (SATA) problem with the goal of maximizing overall user satisfaction, where the user satisfaction integrates the satisfaction towards price and cooperation quality. The SATA problem has been proved to be NP-hard by reducing it from the k -set packing problem. In addition, two algorithms, namely, conflict-aware greedy (CAG) algorithm and game theoretic (GT) algorithm with an optimization strategy, are proposed for solving the SATA problem. The CAG algorithm can efficiently obtain a result with provable approximate bound, while the GT algorithm is proven to be convergent which can find a Nash equilibrium. Extensive experiments have demonstrated the effectiveness and efficiency of our proposed approaches on both real and synthetic datasets. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to investigate optimal control the non-linear fractional-order chaotic system of cancer cells by use of particle swarm optimization and genetic algorithms. The chaotic behavior of cancer cell growth and the tumor growth model were expressed as a system of differential equations. Then, optimal control of cancer cells using drugs was presented. Particle swarm optimization method and genetic algorithms were used to solve the problem of optimal control of cancer cell growth. The results of the control applied to the model can control the cancer cell growth. The application of control results in decreasing the number of cancer cells to zero. When the controller is applied from the beginning, the Results of genetic algorithm method are excellent. All the results obtained for the particle swarm optimization method show that this method has also been very successful and have results very close to the genetic algorithm method. [ABSTRACT FROM AUTHOR]

Purpose: Cloud eases information processing, but it holds numerous risks, including hacking and confidentiality problems. It puts businesses at risk in terms of data security and compliance. This paper aims to maximize the covered human resource (HR) vulnerabilities and minimize the security costs in the enterprise cloud using a fuzzy-based method and firefly optimization algorithm. Design/methodology/approach: Cloud computing provides a platform to improve the quality and availability of IT resources. It changes the way people communicate and conduct their businesses. However, some security concerns continue to derail the expansion of cloud-based systems into all parts of human life. Enterprise cloud security is a vital component in ensuring the long-term stability of cloud technology by instilling trust. In this paper, a fuzzy-based method and firefly optimization algorithm are suggested for optimizing HR vulnerabilities while mitigating security expenses in organizational cloud environments. MATLAB is employed as a simulation tool to assess the efficiency of the suggested recommendation algorithm. The suggested approach is based on the firefly algorithm (FA) since it is swift and reduces randomization throughout the lookup for an optimal solution, resulting in improved performance. Findings: The fuzzy-based method and FA unveil better performance than existing met heuristic algorithms. Using a simulation, all the results are verified. The study findings showed that this method could simulate complex and dynamic security problems in cloud services. Practical implications: The findings may be utilized to assist the cloud provider or tenant of the cloud infrastructure system in taking appropriate risk mitigation steps. Originality/value: Using a fuzzy-based method and FA to maximize the covered HR vulnerabilities and minimize the security costs in the enterprise cloud is the main novelty of this paper. [ABSTRACT FROM AUTHOR]

Neuromorphic processors have gained momentum recently due to their high energy efficiency in artificial intelligence applications compared to DNN accelerators. Most neuromorphic processors are executing SNNs (Spiking Neural Networks). Liquid State Machine (LSM), as the spiking version of reservoir computing, shows advantages and great potential in image classification, speech recognition, language translation, etc.. Comparing with other SNN models, LSM has the characteristics of easy to train and low resource utilization, which is suitable for low-power and resource-constrained edge computing scenarios. In this paper, we propose a novel design of a neuromorphic processor, LSMCore, aiming at LSM acceleration. LSMCore supports both training and inference of LSM. It consists of 256 input neurons, 1024 liquid neurons, and 1.31M synapses. Besides, multiple optimization techniques, including weight quantization for reducing storage, zero-skipping for decreasing dynamic sparsity, and mini-batch training are adopted in this processor. The experimental results show that the frequency of LSMCore achieves 400 MHz, the power is 4.9W and the area is 18.49 mm2 with a 40nm library. Comparing with the baseline, LSMCore achieves up to $80.7\times $ ($49.6\times $), $91.3\times $ ($56.3\times $), and $83.1\times $ ($56.8\times $) speedup on MNIST, N-MNIST, and Free Spoken Digital Dataset (FSDD) respectively for training (inference), while the accuracy of LSMCore on these three datasets are 96.8%, 97.6%, and 90% respectively. [ABSTRACT FROM AUTHOR]

• An adaptive forecast combination of highly diversified models is proposed. • The hyperparameter tuning is conducted through Bayesian optimization. • Our model significantly outperforms the classic and latest methods on extensive datasets. Among various time series (TS) forecasting methods, ensemble forecast is extensively acknowledged as a promising ensemble approach achieving great success in research and industry. Due to the high diversification of individual model assumptions, heterogeneous information fusion contributes to generating effective and robust forecasts for Economics, Meteorology, and Transportation. This paper proposes a Bayesian optimization-based dynamic ensemble (BODE) that overcomes the single model-based methods limitation and provides a dynamic ensemble forecast combination for TS with time-varying underlying patterns. The proposed BODE method combines ten disparate model candidates, including statistical methods, machine learning (ML)-based models, and the latest deep neural networks (DNN). We take into consideration their prediction performance for the recent past to adjust their weights for combination and apply the model-based Bayesian optimization algorithm (BOA) for the combination hyperparameter (HP) tuning to endow our method with higher adaptability and better generalization performance. Besides, the frequency impact of TS data on the ensemble forecast methods is under-researched in the current literature. Therefore, four groups of distinct seasonal TS datasets are investigated in this paper. The empirical result demonstrates that our method performs robustly better performance with the main reasons analyzed in a detailed ablation study. [ABSTRACT FROM AUTHOR]

The main focus of this paper is the presentation of reliable methods for the determination of the optimum coloring of a graph, commonly known in the literature as vertex coloring problem. It has been shown that networks of capacitively coupled oscillators can be used to solve vertex coloring problems. In this paper we address the negative impact of an unbalanced number of couplings for the oscillators on the performance of the network and compensate for this non-uniform coupling structure by an adjustment in the network itself. The negative effect of the memristor device-to-device variability of the NbOx memristor on the array functionality will be investigated and reduced via an adaptation of the memristor operating point. The main improvement in network performance is achieved by setting up a control procedure allowing the network to bypass the local solutions and converge to the global one. Two strategies inspired by global optimization algorithms will be proposed to allow the network to overcome sub-optimal solutions, and find the solution corresponding to the absolute minimum of a performance measure function of the vertex coloring problem. [ABSTRACT FROM AUTHOR]

[Display omitted] • Comparing to the other research papers, this paper compares the performance of the oldest, newest, more minor and well-known algorithms on deterministic chaos generators in one massive and unique study. • Paper show that by precision tuning, the original chaotic series convert into short N periodic time series (PTS). Thus no randomness as usually understand is there. These series are then used instead of classics pseudorandom numbers with positive impact. • Paper reveal the clearly visible positive impact of PTS on evolutionary algorithms (EAs) dynamics, which is visible almost on all algorithms used in this paper. Compared with the same EAs with classic random generators. • Paper open the question of whether standard random (nonchaotic) processes are really necessary for algorithm dynamics and suggest relations between randomness in EAs and noise in dynamical system control and theory. • Paper open, sketch and suggest new ideas and strategies on how to understand algorithm dynamics as the discrete feedback dynamical systems. Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are used in evolutionary algorithms instead of randomness. We suggest that, instead of pseudo-random number generators, a specific class of deterministic processes (based on deterministic chaos) can be used to improve the performance of evolutionary algorithms. Finally, based on our findings, we propose new research questions. [ABSTRACT FROM AUTHOR]

In this paper, a chaotic strategy-based quadratic opposition-based learning adaptive variable-speed whale optimization algorithm is proposed. The improved algorithm is used to solve the problems that the whale optimization algorithm's convergence accuracy and convergence speed are insufficient. Firstly, the proposed algorithm is initialized by a method based on chaotic maps and quadratic opposition-based learning strategy to obtain a population with better ergodicity. Secondly, by introducing an adaptive variable speed adjustment factor, each search link unites to form a negative feedback regulation network, thereby effectively balancing the algorithm's exploration ability and exploitation ability. Finally, 20 benchmark test functions and 3 complex constrained engineering optimization problems were used to conduct extensive tests on the improved algorithm. The results show that the improved algorithm has better performance than others in terms of convergence speed and convergence accuracy in a majority of cases, and can effectively jump out of the local optimum. [Display omitted] • Firstly, this paper proposed a quadratic Opposition-Base Learning strategy based on Bernoulli map, and successfully obtained a higher quality initial whale population. • Secondly, this paper proposed a new variable speed adjustment factor and a cooperative convergence factor, and combine them with individual fitness to form a negative feedback adjustment network. Experiments show that the algorithm has good self-adjusting ability. • Finally, the range of some of the original random numbers in whale optimization algorithm has been changed. This adjustment allows the algorithm to have a more variable search range. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to propose a new assessment system module for handling the comprehensive answers written through the answer interface. Design/methodology/approach: The working principle is under three major phases: Preliminary semantic processing: In the pre-processing work, the keywords are extracted for each answer given by the course instructor. In fact, this answer is actually considered as the key to evaluating the answers written by the e-learners. Keyword and semantic processing of e-learners for hierarchical clustering-based ontology construction: For each answer given by each student, the keywords and the semantic information are extracted and clustered (hierarchical clustering) using a new improved rider optimization algorithm known as Rider with Randomized Overtaker Update (RR-OU). Ontology matching evaluation: Once the ontology structures are completed, a new alignment procedure is used to find out the similarity between two different documents. Moreover, the objects defined in this work focuses on "how exactly the matching process is done for evaluating the document." Finally, the e-learners are classified based on their grades. Findings: On observing the outcomes, the proposed model shows less relative mean squared error measure when weights were (0.5, 0, 0.5), and it was 71.78% and 16.92% better than the error values attained for (0, 0.5, 0.5) and (0.5, 0.5, 0). On examining the outcomes, the values of error attained for (1, 0, 0) were found to be lower than the values when weights were (0, 0, 1) and (0, 1, 0). Here, the mean absolute error (MAE) measure for weight (1, 0, 0) was 33.99% and 51.52% better than the MAE value for weights (0, 0, 1) and (0, 1, 0). On analyzing the overall error analysis, the mean absolute percentage error of the implemented RR-OU model was 3.74% and 56.53% better than k-means and collaborative filtering + Onto + sequential pattern mining models, respectively. Originality/value: This paper adopts the latest optimization algorithm called RR-OU for proposing a new assessment system module for handling the comprehensive answers written through the answer interface. To the best of the authors' knowledge, this is the first work that uses RR-OU-based optimization for developing a new ontology alignment-based online assessment of e-learners. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this paper is to enhance the line congestion and to minimize power loss. Transmission line congestion is considered the most acute trouble during the operation of the power system. Therefore, congestion management acts as an effective tool in using the available power without breaking the system hindrances or limitations. Design/methodology/approach: Over the past few years, determining the optimal location and size of the devices have pinched a great deal of consideration. Numerous approaches have been established to mitigate the congestion rate, and this paper aims to enhance the line congestion and minimize power loss by determining the compensation rate and optimal location of a thyristor-switched capacitor (TCSC) using adaptive moth swarm optimization (AMSO) algorithm. Findings: An AMSO algorithm uses the performances of moth flame and the chaotic local search-based shrinking scheme of the bacterial foraging optimization algorithm. The proposed AMSO approach is executed and discussed for the IEEE-30 bus system for determining the optimal location of single TCSC and dual TCSC. Originality/value: In addition to this, the proposed algorithm is compared with various other existing approaches, and the results thus obtained provide better performances than other techniques. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to apply grey wolf optimizer (GWO) algorithm for steady state analysis of self-excited induction generators (SEIGs) supplying isolated loads. Design/methodology/approach: Taking the equivalent circuit of SEIG, the impedances representing the stator, rotor and the connected load are reduced to a single loop impedance in terms of the unknown frequency, magnetizing reactance and core loss resistance for the given rotor speed. This loop impedance is taken as the objective function and minimized using GWO to solve for the unknown parameters. By including the value of the desired voltage as a constraint, the formulated objective function is also extended for estimating the required excitation capacitance. Findings: The experimental results obtained on a three phase 415 V, 3.5 kW SEIG and the corresponding predetermined performance characteristics agree closely, thereby validating the proposed GWO method. Moreover, a comparative study of GWO with genetic algorithm and particle swarm optimization techniques reveals that GWO exhibits much quicker convergence of the objective function. Originality/value: The important contributions of this paper are as follows: for the first time, GWO has been introduced for the SEIG performance predetermination and computation of the excitation capacitance for attaining the desired terminal voltage for the given load and speed; the predicted performance accuracy is improved by considering the variable core loss of the SEIG; and GWO does not require derivations of lengthy equations for calculating the SEIG performance. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to achieve accurate maximum power from solar photovoltaic (PV), its five parameters need to be estimated. This study proposes a novel optimization technique for parameter estimation of solar PV. Design/methodology/approach: To extract optimal parameters of solar PV new optimization technique based on the Jellyfish search optimizer (JSO). The objective function is defined based on two unknown variables and the proposed technique is used to estimate the two unknown variables and the rest three unknown variables are estimated analytically. Findings: In this paper, JSO is used to estimate the parameters of a single diode PV model. In this study, eight different PV panels are considered. In addition, various performance indices, such as PV characteristics, such as power-voltage and current-voltage curves, relative error (RE), root mean square error (RMSE), mean absolute error (MAE) and normalized mean absolute error (NMAE) are determined using the proposed algorithm and existing algorithms. The results for different solar panels have been obtained under varying environmental conditions such as changing temperature and constant irradiance or changing irradiance and constant temperature. Originality/value: The proposed technique is new and provides better results with minimum RE, RMSE, NMAE, MAE and converges fast, as depicted by the fitness graph presented in this paper. [ABSTRACT FROM AUTHOR]

Purpose: Due to the non-linear nature of the hysteresis behavior, the accurate identification of the parameters of the Bouc–Wen hysteresis model is still a challenging problem. The purpose of this paper is to explore the potential of a heuristic improved whale optimization algorithm (IWOA) to accurately identify the model parameters, which has never been applied to the field of piezoelectric hysteresis identification. Design/methodology/approach: Based on the analysis of the Bouc–Wen model structure and WOA optimization process, an approach that can fully exploit the potential of WOA is proposed. In this work, the position updating formula is improved by introducing non-linear weights, and the convergence factor formula is modified. And thus, the iteration speed, accuracy and stability of the classical WOA can be improved. Findings: The experimental results show that the model output is in good agreement with the response of the real piezoelectric platform. Compared with the standard WOA and particle swarm optimization algorithms, the search performance of the proposed IWOA is better than those two competitors in terms of convergence speed and identification accuracy. Originality/value: An IWOA is proposed according to the properties of the Bouc–Wen model and piezoelectric hysteresis. It has been approved that the algorithm has a good prospect in the identification of piezoelectric hysteresis systems. Furthermore, this method is easy to implement and is a good candidate algorithm to identify Bouc–Wen model parameters. [ABSTRACT FROM AUTHOR]

• We propose a robust suboptimal feedback control problem designed based on the radial basis function. • This problem is approximated as a sequence of nonlinear programming subproblems by some techniques. • A hybrid algorithm is proposed to escape local optimal solutions. The optimal control strategy constructed in the form of a state feedback is effective for small state perturbations caused by changes in modeling uncertainty. In this paper, we investigate a robust suboptimal feedback control (RSPFC) problem governed by a nonlinear time-delayed switched system with uncertain time delay arising in a 1,3-propanediol (1,3-PD) microbial fed-batch process. The feedback control strategy is designed based on the radial basis function to balance the two (possibly competing) objectives: (i) the system performance (concentration of 1,3-PD at the terminal time of the fermentation) is to be optimal; and (ii) the system sensitivity (the system performance with respect to the uncertainty of the time-delay) is to be minimized. The RSPFC problem is subject to the continuous state inequality constraints. An exact penalty method and a novel time scaling transformation approach are used to transform the RSPFC problem into the one subject only to box constraints. The resulting problem is solved by a hybrid optimization algorithm based on a filled function method and a gradient-based algorithm. Numerical results are given to verify the effectiveness of the developed hybrid optimization algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we consider the pricing of American options under a regime-switching double Heston model, such that the interest rate and mean-reversion level parameters in both stochastic volatility models shift in various states. We develop a semi-analytical formula for double Heston partial differential equation by using the equivalent European put option price and standard portfolio-consumption model. Then through the moment-generating function of this particular model, the American put option price is evaluated. We employ the Levenberg–Marquardt optimization method to calibrate the regime-switching double Heston model. Numerical experiments have also been performed to demonstrate the accuracy of the proposed formula and the performance of regime change mechanism on option pricing. Ultimately, through an experimental application, we indicate the proposed model is premier to the double Heston model, which illustrates the importance of considering regime-switching factor. [ABSTRACT FROM AUTHOR]

To solve complex high-dimensional optimization problems, an opposition-based butterfly optimization algorithm with adaptive elite mutation (OBOAEM) is proposed. In the initial stage, the opposition-based learning mechanism is introduced to increase the diversity of the initial population and improve the probability of finding the optimal value. In order to balance the process of global search and local search, the segmental adjustment factor is used to improve the optimization accuracy of the algorithm. In the final stage of the algorithm, the elite mutation strategy is adopted to prevent precocity of the algorithm. In this paper, 23 benchmark functions are selected to test OBOAEM and original algorithm BOA in low dimension, and 16 benchmark functions are introduced to test OBOAEM and eight intelligent optimization algorithms in high dimensions 100, 500 and 1000. In addition, the simulation experiments of 30 CEC2014 complex deformation functions reveal the OBOAEM has a good effect in solving complex optimization problems, which are compared with six state-of-art algorithms. Friedman test is used forstatistical analysis, showing that OBOAEM has better optimization performance for complex high-dimensional problems. Finally, OBOAEM is applied to engineering design problems, and it is proved that OBOAEM is competitive in solving real-world problems. [ABSTRACT FROM AUTHOR]

In the present paper, we put forward and explain the branch and bound method to solve Holder multidimensional bi-objective optimization problems. We start by considering the one-dimensional case and developing an optimization algorithm based on parabolic under-estimators. Those under-estimators generate a sequence of points that will contribute in the identification of the Pareto front of the problem being raised. When seeking these points, we have to solve nonlinear equations that are difficult to solve. Besides, we develop a recursive method suitable for solving such nonlinear equations. Then we widen our focus to deal with Holder multidimensional bi-objective optimization problems. We illustrate how to implement the proposed algorithm in the multidimensional case using α -dense space filling curves. In the last section, we implement the proposed algorithm to solve some numerical examples in the one-dimensional and the multidimensional cases. [ABSTRACT FROM AUTHOR]

Standard evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward and computationally cheap. However, in many real-world optimization problems, these evaluations involve computationally expensive numerical simulations or physical experiments. Surrogate-assisted evolutionary algorithms (SAEAs) have recently gained increased attention for their performance in solving these types of problems. The main idea of SAEAs is the integration of an evolutionary algorithm with a selected surrogate model that approximates the computationally expensive function. In this paper, we propose a surrogate model based on a Lipschitz underestimation and use it to develop a differential evolution-based algorithm. The algorithm, called Lipschitz Surrogate-assisted Differential Evolution (LSADE), utilizes the Lipschitz-based surrogate model, along with a standard radial basis function surrogate model and a local search procedure. The experimental results on seven benchmark functions of dimensions 30, 50, 100, and 200 show that the proposed LSADE algorithm is competitive compared with the state-of-the-art algorithms under a limited computational budget, being especially effective for the very complicated benchmark functions in high dimensions. [ABSTRACT FROM AUTHOR]

The Quantum Approximate Optimization Algorithm (QAOA) is an algorithmic framework for finding approximate solutions to combinatorial optimization problems, derived from an approximation to the Quantum Adiabatic Algorithm (QAA). In solving combinatorial optimization problems with constraints in the context of QAOA, one needs to find a way to encode problem constraints into the scheme. In this paper, we propose and discuss several QAOA-based algorithms to solve combinatorial optimization problems with equality and/or inequality constraints. We formalize the encoding method of different types of constraints, and demonstrate the effectiveness and efficiency of the proposed scheme by providing examples and results for some well-known NP optimization problems. Compared to previous constraint-encoding methods, we argue our work leads to a more generalized framework for finding, in the context of QAOA, higher-quality approximate solutions to combinatorial problems with various types of constraints. [ABSTRACT FROM AUTHOR]