Search results

The purpose of this paper is to present the honey‐bee mating optimization (HBMO) algorithm tested with, first, a well‐known, non‐linear, non‐separable, irregular, multi‐modal “Fletcher‐Powell” function; and second, with a single hydropower reservoir operation optimization problem, to demonstrate the efficiency of the algorithm in handling complex mathematical problems as well as non‐convex water resource management problems. HBMO and genetic algorithm (GA) are applied to the second problem and the results are compared with those of a gradient‐based method non‐linear programming (NLP).

The HBMO algorithm is a hybrid optimization algorithm comprised of three features: simulated annealing, GA, and local search. This algorithm uses the individual features of these approaches and combines them together, resulting in an enhanced performance of HBMO in finding near optimal solutions.

Results of the “Fletcher‐Powell” function show more accuracy and higher convergence speed when applying HBMO algorithm rather than GA. When solving the single hydropower reservoir operation optimization problem, by disregarding evaporation from the model structure, both NLP solver and HBMO resulted in approximately the same near‐optimal solutions. However, when evaporation was added to the model, the NLP solver failed to find a feasible solution, whereas the proposed HBMO algorithm resulted in a feasible, near‐optimal solution.

This paper shows that the HBMO algorithm is not complicated to use and does not require much mathematical sophistication to understand its mechanisms. A tool such as the HBMO algorithm can be considered as an optimization tool able to provide alternative solutions from which designers/decision makers may choose.

This paper aims to examine total annual cost from economic view mixed materials heat exchangers based on three optimization algorithms. This study compares the use of three optimization algorithms in the design of economic optimization shell and tube mixed material heat exchangers.

A shell and tube mixed materials heat exchanger optimization design approach is expanded based on the total annual cost measured by dividing the costs of the heat exchanger to area of surface and power consumption. In this study, optimization and minimization of the total annual cost is considered as the objective function. There are three types of exchangers: cheap, expensive and mixed. Mixed materials are used in corrosive flows in the heat exchanger network. The present study explores the use of three optimization techniques, namely, hybrid genetic-particle swarm optimization, shuffled frog leaping algorithm techniques and ant colony optimization.

There are three parameters as decision variables such as tube outer diameter, shell diameter and central baffle spacing considered for optimization. Results have been compared with the findings of previous studies to demonstrate the accuracy of algorithms.

The present study explores the use of three optimization techniques, namely, hybrid genetic-particle swarm optimization, shuffled frog leaping algorithm techniques and ant colony optimization. This study has demonstrated successful application of each technique for the optimal design of a mixed material shell and tube heat exchanger from the economic view point.

This study aims to examine the theoretical foundations for multivariate portfolio optimization algorithms under illiquid market conditions. In this study, special emphasis is devoted to the application of a risk-engine, which is based on the contemporary concept of liquidity-adjusted value-at-risk (LVaR), to multivariate optimization of investment portfolios.

This paper examines the modeling parameters of LVaR technique under event market settings and discusses how to integrate asset liquidity risk into LVaR models. Finally, the authors discuss scenario optimization algorithms for the assessment of structured investment portfolios and present a detailed operational methodology for computer programming purposes and prospective research design with the backing of a graphical flowchart.

To that end, the portfolio/risk manager can specify different closeout horizons and dependence measures and calculate the necessary LVaR and resulting investable portfolios. In addition, portfolio managers can compare the return/risk ratio and asset allocation of obtained investable portfolios with different liquidation horizons in relation to the conventional Markowitz´s mean-variance approach.

The examined optimization algorithms and modeling techniques have important practical applications for portfolio management and risk assessment, and can have many uses within machine learning and artificial intelligence, expert systems and smart financial applications, financial technology (FinTech), and within big data environments. In addition, it provide key real-world implications for portfolio/risk managers, treasury directors, risk management executives, policymakers and financial regulators to comply with the requirements of Basel III best practices on liquidly risk.

The proposed optimization algorithms can aid in advancing portfolios selection and management in financial markets by assessing investable portfolios subject to meaningful operational and financial constraints. Furthermore, the robust risk-algorithms and portfolio optimization techniques can aid in solving some real-world dilemmas under stressed and adverse market conditions, such as the effect of liquidity when it dries up in financial and commodity markets, the impact of correlations factors when there is a switching in their signs and the integration of the influence of the nonlinear and non-normal distribution of assets’ returns in portfolio optimization and management.

Internet of things (IoT) is essential in technical, social and economic domains, but there are many challenges that researchers are continuously trying to solve. Traditional resource allocation methods in IoT focused on the optimal resource selection process, but the energy consumption for allocating resources is not considered sufficiently. This paper aims to propose a resource allocation technique aiming at energy and delay reduction in resource allocation. Because of the non-deterministic polynomial-time hard nature of the resource allocation issue and the forest optimization algorithm’s success in complex problems, the authors used this algorithm to allocate resources in IoT.

For the vast majority of IoT applications, energy-efficient communications, sustainable energy supply and reduction of latency have been major goals in resource allocation, making operating systems and applications more efficient. One of the most critical challenges in this field is efficient resource allocation. This paper has provided a new technique to solve the mentioned problem using the forest optimization algorithm. To simulate and analyze the proposed technique, the MATLAB software environment has been used. The results obtained from implementing the proposed method have been compared to the particle swarm optimization (PSO), genetic algorithm (GA) and distance-based algorithm.

Simulation results show that the proper performance of the proposed technique. The proposed method, in terms of “energy” and “delay,” is better than other ones (GA, PSO and distance-based algorithm).

The paper presents a useful method for improving resource allocation methods. The proposed method has higher efficiency compared to the previous methods. The MATLAB-based simulation results have indicated that energy consumption and delay have been improved compared to other algorithms, which causes the high application of this method in practical projects. In the future, the focus will be on resource failure and reducing the service level agreement violation rate concerning the number of resources.

The proposed technique can solve the mentioned problem in the IoT with the best resource utilization, low delay and reduced energy consumption. The proposed forest optimization-based algorithm is a promising technique to help enterprises participate in IoT initiatives and develop their business.

The purpose of this paper is to overcome the application limitations of other multi-variable regression based on polynomials due to the huge computation room and time cost.

In this paper, based on the idea of feature selection and cascaded regression, two strategies including Laguerre polynomials and manifolds optimization are proposed to enhance the accuracy of multi-variable regression. Laguerre polynomials were combined with the genetic algorithm to enhance the capacity of polynomials approximation and the manifolds optimization method was introduced to solve the co-related optimization problem.

Two multi-variable Laguerre polynomials regression methods are designed. Firstly, Laguerre polynomials are combined with feature selection method. Secondly, manifolds component analysis is adopted in cascaded Laguerre polynomials regression method. Two methods are brought to enhance the accuracy of multi-variable regression method.

With the increasing number of variables in regression problem, the stable accuracy performance might not be kept by using manifold-based optimization method. Moreover, the methods mentioned in this paper are not suitable for the classification problem.

Experiments are conducted on three types of datasets to evaluate the performance of the proposed regression methods. The best accuracy was achieved by the combination of cascade, manifold optimization and Chebyshev polynomials, which implies that the manifolds optimization has stronger contribution than the genetic algorithm and Laguerre polynomials.

Meta-heuristic algorithms are efficient in achieving the optimal solution for engineering problems. Hybridization of different algorithms may enhance the quality of the solutions and improve the efficiency of the algorithms. The purpose of this paper is to propose a novel, robust hybrid meta-heuristic optimization approach by adding differential evolution (DE) mutation operator to the accelerated particle swarm optimization (APSO) algorithm to solve numerical optimization problems.

The improvement includes the addition of DE mutation operator to the APSO updating equations so as to speed up convergence.

A new optimization method is proposed by introducing DE-type mutation into APSO, and the hybrid algorithm is called differential evolution accelerated particle swarm optimization (DPSO). The difference between DPSO and APSO is that the mutation operator is employed to fine-tune the newly generated solution for each particle, rather than random walks used in APSO.

A novel hybrid method is proposed and used to optimize 51 functions. It is compared with other methods to show its effectiveness. The effect of the DPSO parameters on convergence and performance is also studied and analyzed by detailed parameter sensitivity studies.

The purpose of this study is to develop a new parallel metaheuristic algorithm for solving unconstrained continuous optimization problems.

The proposed method brings several metaheuristic algorithms together to form a coalition under Weighted Superposition Attraction-Repulsion Algorithm (WSAR) in a parallel computing environment. The proposed approach runs different single solution based metaheuristic algorithms in parallel and employs WSAR (which is a recently developed and proposed swarm intelligence based optimizer) as controller.

The proposed approach is tested against the latest well-known unconstrained continuous optimization problems (CEC2020). The obtained results are compared with some other optimization algorithms. The results of the comparison prove the efficiency of the proposed method.

This study aims to combine different metaheuristic algorithms in order to provide a satisfactory performance on solving the optimization problems by benefiting their diverse characteristics. In addition, the run time is shortened by parallel execution. The proposed approach can be applied to any type of optimization problems by its problem-independent structure.

To show the successful use of self‐organising fuzzy control in enhancing dynamic optimisation, a controller is used to direct the type of optimisation appropriate in each new dynamic problem. The system uses its experiences to determine which approach is most suitable under varying circumstances.

A knowledge extraction tool is used to gain basic information about the solution space with a simple computation. This information is compared with the fuzzy rules stored in the system. These rules hold a collection of facts on previous successes and failures, which were acquired through the performance monitor. Using this system the controller directs the algorithms, deciphering the most appropriate strategy for the current problem.

This procedure is designed for large scale dynamic optimisation problems, where a portion of the computational time is sacrificed to allow the controller to direct the best possible solution strategy. The results here are based on smaller scale systems, which illustrate the benefits of the technique.

The results highlight two significant aspects. From the comparison of the three algorithms without the use of the controller, a pattern can be seen in how the algorithms perform on different types of problems. Results show an improvement in the overall quality when the controller is employed.

This paper introduces a novel approach to the problem dynamic optimisation. It combines the control ability of self‐organising fuzzy logic with a range of optimisation techniques to obtain the best possible approach in any one situation.

This paper aims to resolve the sizing issues of analog circuit design by using proposed metaheuristic optimization algorithm.

The hybridization of whale optimization algorithm and modified gray wolf optimization (WOA-mGWO) algorithm is proposed, and the same is applied for the automated design of analog circuits.

The proposed hybrid WOA-mGWO algorithm demonstrates better performance in terms of convergence rates and average fitness of the function after testing it with 23 classical benchmark functions. Moreover, a rigorous performance evaluation is done with 20 independent runs using Wilcoxon rank-sum test.

For evaluating the performance of the proposed algorithm, a conventional two-stage operational amplifier is considered. The aspect ratios calculated by simulating the algorithm in MATLAB are later used to design the operational amplifier in Cadence environment using 180nm CMOS standard process.

The hybrid WOA-mGWO algorithm is tailored to improve the exploration ability of the algorithm by combining the abilities of two metaheristic algorithms, i.e. whale optimization algorithm and modified gray wolf optimization algorithm. To build further credence and to prove its profound existence in the latest state of the art, a statistical study is also conducted over 20 independent runs, for the robustness of the proposed algorithm, resulting in best, mean and worst solutions for analog IC sizing problem. A comparison of the best solution with other significant sizing tools proving the efficiency of hybrid WOA-mGWO algorithm is also provided. Montecarlo simulation and corner analysis are also performed to validate the endurance of the design.

Wireless Body Area Network (WBAN) technology envisions a network in which sensors continuously operate on and obtained critical physical and physiological readings. Sensors deployed in WBANs have restricted resources such as battery energy, computing power and bandwidth. We can utilize these resources efficiently. By devising a mechanism that is energy efficient with following characteristics, i.e. computational complexity is less, routing overhead is minimized, and throughput will be maximum. A lot of work has been done in this area but still WBAN faces some challenges like mobility, network lifetime, transmission range, heterogeneous environment, and limited resources. In the present years well, contemplative studies have been made through a large body to reach some holistic points pertaining to the energy consumption in WBAN. Thus we/put forward appropriate algorithm for energy efficiency which can vividly corroborate the advances in this specific domain. We have also focused on various aspects and phases of the studies like study computational complexity, routing overhead and throughput type of characteristics. There is still a room for improvement to get the desired energy optimization in WBAN. The network performance mainly relies upon the algorithm used for optimization process. In this work, we intended to develop an energy optimization algorithm for energy consumption in WBAN which is based on evolutionary algorithms for inter-BAN communications using cluster-based routing protocol.

In this paper we propose a meta heuristics algorithm Goa to solve the optimization problem in WBAN. Grasshopper is an insect. Generally, this insect is viewed individually and creating large swarm in nature. Figure 5 shows the individual grasshoppers' primitive patterns in swarm. Figure 7 depicts the pseudo code of Goa. In Goa, experiments are done to view the behavior of grasshoppers in swarm. How they gradually move towards the stationary and mobile target. Through experimentation it is conceived that swarm gradually converge towards their target. Another interesting pattern related to convergence of grasshopper is that it slowly towards its target. This shows that grasshopper does not trapped in local optima. In starting iterations of exploration process Goa, search globally and in last iterations it searches local optima. Goa makes the exploration and exploitation process balanced while solving challenging optimization problems.

Energy efficiency is achieved in the optimization process of cluster formation process. As the use of proposed algorithm Goa creates the optimal number of clusters. Shorter cluster lifetime means more times clustering procedure is called. It increases the network computational cost and the communication overhead. Experimentation results show that proposed Goa algorithm performs well. We compare the results of Goa with existing optimization Algorithms ACO and MFO. Results are generated using MATLAB.

A lot of work has done for the sake of energy optimization in WBAN. Many algorithms are proposed in past for energy optimization of WBAN. All of them have some strengths and weaknesses. In this paper we propose a nature inspired algorithm Goa. We use the Goa algorithm for the sake of energy optimization in WBAN.