Search results

The purpose of this paper is to propose an optimum design of a corona ring for insulator strings using optimisation techniques, which are gravitational search algorithm (GSA) and imperialist competitive algorithm (ICA).

An insulator string model geometry with a corona ring was modelled in a finite element analysis software, and it was used to obtain the electric field distribution in the model. The design was optimised using GSA and ICA. The variables were the corona ring diameter, ring tube diameter and vertical position of the ring along the insulator string.

Using optimisation method, the minimum electric field magnitude on the insulator string with a corona ring design is lower than without using optimisation method. GSA yields better results than ICA in terms of the optimised corona ring design.

The proposed methods can help in improvement of corona ring design in reducing the electric field magnitude on the energised end of insulator strings.

A new method to design an optimum corona ring for insulator strings, which is using optimisation methods, has been developed in this work.

The purpose of this research is to study the Multi-Skill Resource-Constrained Multi-Project Scheduling Problem (MSRCMPSP), where (1) durations of activities depend on the familiarity levels of assigned workers, (2) more efficient workers demand higher per-day salaries, (3) projects have different due dates and (4) the budget of each period varies over time. The proposed model is bi-objective, and its objectives are minimization of completion times and costs of all projects, simultaneously.

This paper proposes a two-phase approach based on the Statistical Process Control (SPC) to solve this problem. This approach aims to develop a control chart so as to monitor the performance of an optimizer during the optimization process. In the first phase, a multi-objective statistical model has been used to obtain control limits of this chart. To solve this model, a Multi-Objective Greedy Randomized Adaptive Search Procedure (MOGRASP) has been hired. In the second phase, the MSRCMPSP is solved via a New Version of the Multi-Objective Variable Neighborhood Search Algorithm (NV-MOVNS). In each iteration, the developed control chart monitors the performance of the NV-MOVNS to obtain proper solutions. When the control chart warns about an out-of control state, a new procedure based on the Conway’s Game of Life, which is a cellular automaton, is used to bring the algorithm back to the in-control state.

The proposed two-phase approach has been used in solving several standard test problems available in the literature. The results are compared with the outputs of some other methods to assess the efficiency of this approach. Comparisons imply the high efficiency of the proposed approach in solving test problems with different sizes.

The proposed model and approach have been used to schedule multiple projects of a construction company in Iran. The outputs show that both the model and the NV-MOVNS can be used in real-world multi-project scheduling problems.

Due to the numerous numbers of studies reviewed in this research, the authors discovered that there are few researches on the multi-skill resource-constrained multi-project scheduling problem (MSRCMPSP) with the aforementioned characteristics. Moreover, none of the previous researches proposed an SPC-based solution approach for meta-heuristics in order to solve the MSRCMPSP.

The purpose of this paper is to investigate the performance of chaotic gravitational search algorithm (CGSA) in solving mechanical engineering design frameworks including welded beam design (WBD), compression spring design (CSD) and pressure vessel design (PVD).

In this study, ten chaotic maps were combined with gravitational constant to increase the exploitation power of gravitational search algorithm (GSA). Also, CGSA has been used for maintaining the adaptive capability of gravitational constant. Furthermore, chaotic maps were used for overcoming premature convergence and stagnation in local minima problems of standard GSA.

The chaotic maps have shown efficient performance for WBD and PVD problems. Further, they have depicted competitive results for CSD framework. Moreover, the experimental results indicate that CGSA shows efficient performance in terms of convergence speed, cost function minimization, design variable optimization and successful constraint handling as compared to other participating algorithms.

The use of chaotic maps in standard GSA is a new beginning for research in GSA particularly convergence and time complexity analysis. Moreover, CGSA can be used for solving the infinite impulsive response (IIR) parameter tuning and economic load dispatch problems in electrical sciences.

The hybridization of chaotic maps and evolutionary algorithms for solving practical engineering problems is an emerging topic in metaheuristics. In the literature, it can be seen that researchers have used some chaotic maps such as a logistic map, Gauss map and a sinusoidal map more rigorously than other maps. However, this work uses ten different chaotic maps for engineering design optimization. In addition, non-parametric statistical test, namely, Wilcoxon rank-sum test, was carried out at 5% significance level to statistically validate the simulation results. Besides, 11 state-of-the-art metaheuristic algorithms were used for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.

Virtual machines (VMs) are suggested by the providers of cloud services as the services for the users over the internet. The consolidation of VM is the tactic of the competent and smart utilization of resources from cloud data centers. Placement of a VM is one of the significant issues in cloud computing (CC). Physical machines in a cloud environment are aware of the way of the VM placement (VMP) as the mapping VMs. The basic target of placement of VM issue is to reduce the physical machines' items that are running or the hosts in cloud data centers. The VMP methods have an important role in the CC. However, there is no systematic and complete way to discuss and analyze the algorithms. The purpose of this paper is to present a systematic survey of VMP techniques. Also, the benefits and weaknesses connected with selected VMP techniques have been debated, and the significant issues of these techniques are addressed to develop the more efficient VMP technique for the future.

Because of the importance of VMP in the cloud environments, in this paper, the articles and important mechanisms in this domain have been investigated systematically. The VMP mechanisms have been categorized into two major groups, including static and dynamic mechanisms.

The results have indicated that an appropriate VMP has the capacity to decrease the resource consumption rate, energy consumption and carbon emission rate. VMP approaches in computing environment still need improvements in terms of reducing related overhead, consolidation of the cloud environment to become an extremely on-demand mechanism, balancing the load between physical machines, power consumption and refining performance.

This study aimed to be comprehensive, but there were some limitations. Some perfect work may be eliminated because of applying some filters to choose the original articles. Surveying all the papers on the topic of VMP is impossible, too. Nevertheless, the authors are trying to present a complete survey over the VMP.

The consequences of this research will be valuable for academicians, and it can provide good ideas for future research in this domain. By providing comparative information and analyzing the contemporary developments in this area, this research will directly support academics and working professionals for better knowing the growth in the VMP area.

The gathered information in this paper helps to inform the researchers with the state of the art in the VMP area. Totally, the VMP's principal intention, current challenges, open issues, strategies and mechanisms in cloud systems are summarized by explaining the answers.

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

In this study, the authors consider the key decisions in the design of the green closed-loop supply chain (CSLC) network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, in this paper is the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered.

In this study, the author consider the key decisions in the design of the green CLSC network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered.

The results indicate that the results obtained from the colonial competition algorithm have higher quality than the genetic algorithm. This quality of results includes relative percentage deviation and computational time of the algorithm and it is shown that the computational time of the colonial competition algorithm is significantly lower than the computational time of the genetic algorithm. Furthermore, the limit test and sensitivity analysis results show that the proposed model has sufficient accuracy.

Solid modeling of the green supply chain of the closed loop using the solid optimized method by Bertsimas and Sim. Development of models that considered environmental impacts to the closed loop supply chain. Considering the impact of the technology type in the manufacture of products and the recycling of waste that will reduce emissions of environmental pollutants. Another innovation of the model is the multi-cycle modeling of the closed loop of supply chain by considering the uncertainty and the fixed and variable cost of transport.

Assembly lines are one of the places where energy consumption is intensive in manufacturing enterprises. The use of robots in assembly lines not only increases productivity but also increases energy consumption and carbon emissions. The purpose of this paper is to minimize the cycle time and total energy consumption simultaneously in parallel robotic assembly lines (PRAL).

Due to the NP-hardness of the problem, A Pareto hybrid discrete firefly algorithm based on probability attraction (PHDFA-PA) is developed. The algorithm parameters are optimized using the Taguchi method. To evaluate the results of the algorithm, a multi-objective programming model and a restarted simulated annealing (RSA) algorithm are used.

According to the comparative study, the PHDFA-PA has a competitive performance with the RSA. Thus, it is possible to achieve a sustainable PRAL through the proposed method by addressing the cycle time and total energy consumption simultaneously.

To the best knowledge of the authors, this is the first study addressing energy consumption in PRAL. The proposed method for PRAL is efficient in solving the multi-objective balancing problem.

Nowadays, more interest is found among the researchers in MANETs in practical and theoretical areas and their performance under various environments. WSNs have begun to combine with the IoT via the sensing capability of Internet-connected devices and the Internet access ability of sensor nodes. It is essential to shelter the network from attacks over the Internet by keeping the secure router.

This paper plans to frame an effective literature review on diverse intrusion detection and prevention systems in Wireless Sensor Networks (WSNs) and Mobile Ad hoc NETworks (MANETs) highly suitable for security in Internet of Things (IoT) applications. The literature review is focused on various types of attacks concentrated in each contribution and the adoption of prevention and mitigation models are observed. In addition, the types of the dataset used, types of attacks concentrated, types of tools used for implementation, and performance measures analyzed in each contribution are analyzed. Finally, an attempt is made to conclude the review with several future research directions in designing and implementing IDS for MANETs that preserve the security aspects of IoT.

It observed the different attack types focused on every contribution and the adoption of prevention and mitigation models. Additionally, the used dataset types, the focused attack types, the tool types used for implementation, and the performance measures were investigated in every contribution.

This paper presents a literature review on diverse contributions of attack detection and prevention, and the stand of different machine learning and deep learning models along with the analysis of types of the dataset used, attacks concentrated, tools used for implementation and performance measures on the network security for IoT applications.

Increasing the system reliability is one of the most important concerns in an industrial plant to become competitive. However, focusing on the overall system reliability increases the overall design cost. The problem is investigated as a multiobjective optimization problem.

It implements the Multiobjective Plant Propagation Algorithm (PPA), also known as the Strawberry Algorithm for the system reliability-redundancy allocation problem.

The Pareto set of a pharmaceutical plant involving ten subsystems connected in series is generated in order to highlight the applicability of the algorithm.

Limitations include the study of two objective functions.

It allows the decision-maker to select the best solution according to his target.

This work represents the first implementation of the multiobjective PPA for solving the multiobjective system reliability optimization in the literature.

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.

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

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

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.