Search results

1 – 10 of 361
Article
Publication date: 30 September 2014

Gai-Ge Wang, Amir Hossein Gandomi, Xin-She Yang and Amir Hossein Alavi

Meta-heuristic algorithms are efficient in achieving the optimal solution for engineering problems. Hybridization of different algorithms may enhance the quality of the solutions…

1011

Abstract

Purpose

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.

Design/methodology/approach

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

Findings

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.

Originality/value

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.

Details

Engineering Computations, vol. 31 no. 7
Type: Research Article
ISSN: 0264-4401

Keywords

Article
Publication date: 4 December 2017

Halim Merabti and Khaled Belarbi

Rapid solution methods are still a challenge for difficult optimization problems among them those arising in nonlinear model predictive control. The particle swarm optimization…

Abstract

Purpose

Rapid solution methods are still a challenge for difficult optimization problems among them those arising in nonlinear model predictive control. The particle swarm optimization algorithm has shown its potential for the solution of some problems with an acceptable computation time. In this paper, we use an accelerated version of PSO for the solution of simple and multiobjective nonlinear MBPC for unmanned vehicles (mobile robots and quadcopter) for tracking trajectories and obstacle avoidance. The AµPSO-NMPC was applied to control a LEGO mobile robot for the tracking of a trajectory without and with obstacles avoidance one.

Design/methodology/approach

The accelerated PSO and the NMPC are used to control unmanned vehicles for tracking trajectories and obstacle avoidance.

Findings

The results of the experiments are very promising and show that AµPSO can be considered as an alternative to the classical solution methods.

Originality/value

The computation time is less than 0.02 ms using an Intel Core i7 with 8GB of RAM.

Details

World Journal of Engineering, vol. 14 no. 6
Type: Research Article
ISSN: 1708-5284

Keywords

Article
Publication date: 21 July 2020

Khurram Shahzad Sana and Weiduo Hu

The aim of this study is to design a guidance method to generate a smoother and feasible gliding reentry trajectory, a highly constrained problem by formalizing the control…

Abstract

Purpose

The aim of this study is to design a guidance method to generate a smoother and feasible gliding reentry trajectory, a highly constrained problem by formalizing the control variables profile.

Design/methodology/approach

A novel accelerated fractional-order particle swarm optimization (FAPSO) method is proposed for velocity updates to design the guidance method for gliding reentry flight vehicles with fixed final energy.

Findings

By using the common aero vehicle as a test case for the simulation purpose, it is found that during the initial phase of the longitudinal guidance, there are oscillations in the state parameters which cause to violate the path constraints. For the glide phase of the longitudinal guidance, the path constraints have higher values because of the increase in the atmosphere density.

Research limitations/implications

The violation in the path constraints may compromise the flight vehicle safety, whereas the enforcement assures the flight safety by flying it within the reentry corridor.

Originality/value

An oscillation suppression scheme is proposed by using the FAPSO method during the initial phase of the reentry flight, which smooths the trajectory and enforces the path constraints partially. To enforce the path constraints strictly in the glide phase, ultimately, another scheme by using the FAPSO method is proposed. The simulation results show that the proposed algorithm is efficient to achieve better convergence and accuracy for nominal as well as dispersed conditions.

Details

Aircraft Engineering and Aerospace Technology, vol. 92 no. 8
Type: Research Article
ISSN: 1748-8842

Keywords

Article
Publication date: 24 June 2013

Gai-Ge Wang, Amir Hossein Gandomi and Amir Hossein Alavi

To improve the performance of the krill herd (KH) algorithm, in this paper, a series of chaotic particle-swarm krill herd (CPKH) algorithms are proposed for solving optimization…

Abstract

Purpose

To improve the performance of the krill herd (KH) algorithm, in this paper, a series of chaotic particle-swarm krill herd (CPKH) algorithms are proposed for solving optimization tasks within limited time requirements. The paper aims to discuss these issues.

Design/methodology/approach

In CPKH, chaos sequence is introduced into the KH algorithm so as to further enhance its global search ability.

Findings

This new method can accelerate the global convergence speed while preserving the strong robustness of the basic KH.

Originality/value

Here, 32 different benchmarks and a gear train design problem are applied to tune the three main movements of the krill in CPKH method. It has been demonstrated that, in most cases, CPKH with an appropriate chaotic map performs superiorly to, or at least highly competitively with, the standard KH and other population-based optimization methods.

Article
Publication date: 11 March 2020

Paridhi Rai and Asim Gopal Barman

The purpose of this paper is to minimize the volume of straight bevel gear and to develop resistance towards scoring failure in the straight bevel gear. Two evolutionary and more…

Abstract

Purpose

The purpose of this paper is to minimize the volume of straight bevel gear and to develop resistance towards scoring failure in the straight bevel gear. Two evolutionary and more advance optimization techniques were used for performing optimization of straight bevel gears, which will also save computational time and will be less computationally expensive compared to a previously used optimization for design optimization of straight bevel gear.

Design/methodology/approach

The following two different cases are considered for the study: the first mathematical model similar to that used earlier and without any modification to show efficiency of the optimization algorithm for straight bevel gear design optimization and the second mathematical model consist of constraints on scoring and contact ratio along with other generally used design constraints. Real coded genetic algorithm (RCGA) and accelerated particle swarm optimization (APSO) are used to optimize the straight bevel gear design. The effectiveness of the algorithms used has been validated by comparing the obtained results with previously published results.

Findings

It has been found that APSO and RCGA outperform other algorithms for straight bevel gear design. Optimized design values have reduced the scoring effect significantly. The values of the contact ratio obtained further enhances the meshing operation of the bevel gear drive by making it smoother and quieter.

Originality/value

Low volume is one of the essential requirements of gearing applications. Scoring is a critical gear failure aspect that leads to the broken tooth in both high speed and low-speed applications of gears. The occurrence of scoring is hard to detect early and analyse. Scoring failure and contact ratio have been introduced as design constraints in the mathematical model. So, the mathematical model demonstrated in this paper minimizes the volume of the straight bevel gear drive, which has been very less attempted in previous studies, with scoring and contact ratio as some of the important design constraints, which the objective function has been subjected to. Also, two advanced and evolutionary optimization algorithms have been used to implement the mathematical model to reduce the computational time required to attain the optimal solution.

Article
Publication date: 19 August 2021

Renuka Devi D. and Sasikala S.

The purpose of this paper is to enhance the accuracy of classification of streaming big data sets with lesser processing time. This kind of social analytics would contribute to…

Abstract

Purpose

The purpose of this paper is to enhance the accuracy of classification of streaming big data sets with lesser processing time. This kind of social analytics would contribute to society with inferred decisions at a correct time. The work is intended for streaming nature of Twitter data sets.

Design/methodology/approach

It is a demanding task to analyse the increasing Twitter data by the conventional methods. The MapReduce (MR) is used for quickest analytics. The online feature selection (OFS) accelerated bat algorithm (ABA) and ensemble incremental deep multiple layer perceptron (EIDMLP) classifier is proposed for Feature Selection and classification. Three Twitter data sets under varied categories are investigated (product, service and emotions). The proposed model is compared with Particle Swarm Optimization, Accelerated Particle Swarm Optimization, accelerated simulated annealing and mutation operator (ASAMO). Feature Selection algorithms and classifiers such as Naïve Bayes, support vector machine, Hoeffding tree and fuzzy minimal consistent class subset coverage with the k-nearest neighbour (FMCCSC-KNN).

Findings

The proposed model is compared with PSO, APSO, ASAMO. Feature Selection algorithms, and classifiers such as Naïve Bayes (NB), support vector machine (SVM), Hoeffding Tree (HT), and Fuzzy Minimal Consistent Class Subset Coverage with the K-Nearest Neighbour (FMCCSC-KNN). The outcome of the work has achieved an accuracy of 99%, 99.48%, 98.9% for the given data sets with the processing time of 0.0034, 0.0024, 0.0053, seconds respectively.

Originality/value

A novel framework is proposed for Feature Selection and classification. The work is compared with the authors’ previously developed classifiers with other state-of-the-art Feature Selection and classification algorithms.

Details

International Journal of Web Information Systems, vol. 17 no. 6
Type: Research Article
ISSN: 1744-0084

Keywords

Article
Publication date: 15 November 2018

Siqi Li and Yimin Deng

The purpose of this paper is to propose a new algorithm for independent navigation of unmanned aerial vehicle path planning with fast and stable performance, which is based on…

Abstract

Purpose

The purpose of this paper is to propose a new algorithm for independent navigation of unmanned aerial vehicle path planning with fast and stable performance, which is based on pigeon-inspired optimization (PIO) and quantum entanglement (QE) theory.

Design/methodology/approach

A biomimetic swarm intelligent optimization of PIO is inspired by the natural behavior of homing pigeons. In this paper, the model of QEPIO is devised according to the merging optimization of basic PIO algorithm and dynamics of QE in a two-qubit XXZ Heisenberg System.

Findings

Comparative experimental results with genetic algorithm, particle swarm optimization and traditional PIO algorithm are given to show the convergence velocity and robustness of our proposed QEPIO algorithm.

Practical implications

The QEPIO algorithm hold broad adoption prospects because of no reliance on INS, both on military affairs and market place.

Originality/value

This research is adopted to solve path planning problems with a new aspect of quantum effect applied in parameters designing for the model with the respective of unmanned aerial vehicle path planning.

Details

Aircraft Engineering and Aerospace Technology, vol. 91 no. 1
Type: Research Article
ISSN: 1748-8842

Keywords

Article
Publication date: 17 May 2022

Vijay Raviprabhakaran

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…

Abstract

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.

Details

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering , vol. 41 no. 5
Type: Research Article
ISSN: 0332-1649

Keywords

Article
Publication date: 3 July 2020

Kapil Netaji Vhatkar and Girish P. Bhole

The containerization application is one among the technologies that enable microservices architectures, which is observed to be the model for operating system (OS) virtualization…

Abstract

Purpose

The containerization application is one among the technologies that enable microservices architectures, which is observed to be the model for operating system (OS) virtualization. Containers are the virtual instances of the OS that are structured as the isolation for the OS atmosphere and its file system, which are executed on the single kernel and a single host. Hence, every microservice application is evolved in a container without launching the total virtual machine. The system overhead is minimized in this way as the environment is maintained in a secured manner. The exploitation of a microservice is as easy to start the execution of a new container. As a result, microservices could scale up by simply generating new containers until the required scalability level is attained. This paper aims to optimize the container allocation.

Design/methodology/approach

This paper introduces a new customized rider optimization algorithm (C-ROA) for optimizing the container allocation. The proposed model also considers the impact of system performance along with its security. Moreover, a new rescaled objective function is defined in this work that considers threshold distance, balanced cluster use, system failure, total network distance and security as well. At last, the performance of proposed work is compared over other state-of-the-art models with respect to convergence and cost analysis.

Findings

For experiment 1, the implemented model at 50th iteration has achieved minimal value, which is 29.24%, 24.48% and 21.11% better from velocity updated grey wolf optimisation (VU-GWO), whale random update assisted LA (WR-LA) and rider optimization algorithm (ROA), respectively. Similarly, on considering Experiment 2, the proposed model at 100th iteration attained superior performance than conventional models such as VU-GWO, WR-LA and ROA by 3.21%, 7.18% and 10.19%, respectively. The developed model for Experiment 3 at 100th iteration is 2.23%, 5.76% and 6.56% superior to VU-GWO, WR-LA and ROA.

Originality/value

This paper presents the latest fictional optimization algorithm named ROA for optimizing the container allocation. To the best of the authors’ knowledge, this is the first study that uses the C-ROA for optimization.

Details

International Journal of Pervasive Computing and Communications, vol. 16 no. 3
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 29 July 2019

Vishweshwara P.S., Harsha Kumar M.K., N. Gnanasekaran and Arun M.

Many a times, the information about the boundary heat flux is obtained only through inverse approach by locating the thermocouple or temperature sensor in accessible boundary…

Abstract

Purpose

Many a times, the information about the boundary heat flux is obtained only through inverse approach by locating the thermocouple or temperature sensor in accessible boundary. Most of the work reported in literature for the estimation of unknown parameters is based on heat conduction model. Inverse approach using conjugate heat transfer is found inadequate in literature. Therefore, the purpose of the paper is to develop a 3D conjugate heat transfer model without model reduction for the estimation of heat flux and heat transfer coefficient from the measured temperatures.

Design/methodology/approach

A 3 D conjugate fin heat transfer model is solved using commercial software for the known boundary conditions. Navier–Stokes equation is solved to obtain the necessary temperature distribution of the fin. Later, the complete model is replaced with neural network to expedite the computations of the forward problem. For the inverse approach, genetic algorithm (GA) and particle swarm optimization (PSO) are applied to estimate the unknown parameters. Eventually, a hybrid algorithm is proposed by combining PSO with Broyden–Fletcher–Goldfarb–Shanno (BFGS) method that outperforms GA and PSO.

Findings

The authors demonstrate that the evolutionary algorithms can be used to obtain accurate results from simulated measurements. Efficacy of the hybrid algorithm is established using real time measurements. The hybrid algorithm (PSO-BFGS) is more efficient in the estimation of unknown parameters for experimentally measured temperature data compared to GA and PSO algorithms.

Originality/value

Surrogate model using ANN based on computational fluid dynamics simulations and in-house steady state fin experiments to estimate the heat flux and heat transfer coefficient separately using GA, PSO and PSO-BFGS.

Details

Engineering Computations, vol. 36 no. 9
Type: Research Article
ISSN: 0264-4401

Keywords

1 – 10 of 361