Search results

Software module clustering is one of the reverse engineering techniques, which is considered to be an effective technique for presenting software architecture and structural information. The objective of clustering software modules is to achieve minimum coupling among different clusters and create maximum cohesion among the modules of each cluster. Finding the best clustering is considered to be a multi-objective N-P hard optimization-problem, and for solving this problem, different meta-heuristic algorithms have been previously proposed. Achieving higher module lustering quality (MQ), obtaining higher success rate for achieving the best clustering quality and improving convergence speed are the main objectives of this study.

In this study, a method (Bölen) is proposed for clustering software modules which combines the two algorithms of shuffled frog leaping and genetic algorithm.

The results of conducted experiments using traditional data sets confirm that the proposed method outperforms the previous methods in terms of convergence speed, module clustering quality and stability of the results.

The study proposes SFLA_GA algorithm for optimizing software module clustering, implementing SFLA algorithm in a discrete form by two operators of the genetic algorithm and achieving the above-mentioned purposes in this study. The aim is to achieve higher performance of the proposed algorithm in comparison with other algorithms.

Attitude control of unmanned aerial vehicle (UAV) is the purposeful manipulation of controllable external forces to establish a desired attitude, which is inner‐loop of the autonomous flight control system. In the practical applications, classical control methods such as proportional‐integral‐derivative control are usually selected because of simple and high reliability. However, it is usually difficult to select or optimize the control parameters. The purpose of this paper is to investigate an intelligent algorithm based classical controller of UAV.

Among the many intelligent algorithms, shuffled frog leaping algorithm (SFLA) combines the benefits of the genetic‐based memetic algorithm as well as social behavior based particle swarm optimization. SFLA is a population based meta‐heuristic intelligent optimization method inspired by natural memetics. In order to improve the performance of SFLA, a different dividing method of the memeplexes is presented to make their performance balance; moreover, an evolution mechanism of the best frog is introduced to make the algorithm jump out the local optimum. The modified SFLA is applied to the tuning of the proportional coefficients of pitching and rolling channels of UAV flight control system.

Simulation of a UAV control system in which the nonlinear model is obtained by the wind tunnel experiment show the rapid dynamic response and high control precision by using the modified SFLA optimized attitude controller, which is better than that of the original SFLA and particle swarm optimization method.

A modification scheme is presented to improve the global searching capability of SFLA. The modified SFLA based intelligent determination method of the UAV flight controller parameters is proposed, in order to improve the attitude control performance of UAV.

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.

Since the last few decades, Artificial Neural Networks have been the center of attraction of a large number of researchers for solving diversified problem domains. Due to its distinguishing features such as generalization ability, robustness and strong ability to tackle nonlinear problems, it appears to be more popular in financial time series modeling and prediction. In this paper, a Pi-Sigma Neural Network is designed for foretelling the future currency exchange rates in different prediction horizon. The unrevealed parameters of the network are interpreted by a hybrid learning algorithm termed as Shuffled Differential Evolution (SDE). The main motivation of this study is to integrate the partitioning and random shuffling scheme of Shuffled Frog Leaping algorithm with evolutionary steps of a Differential Evolution technique to obtain an optimal solution with an accelerated convergence rate. The efficiency of the proposed predictor model is actualized by predicting the exchange rate price of a US dollar against Swiss France (CHF) and Japanese Yen (JPY) accumulated within the same period of time.

The purpose of this paper is to compare the performance of the genetic algorithm (GA), simulate annealing (SA) and shuffled frog-leaping algorithm (SFLA) in solving discrete versus continuous-variable optimization problems of the finance-based scheduling. This involves the minimization of the project duration and consequently the time-related cost components of construction contractors including overheads, finance costs and delay penalties.

The meta-heuristics of the GA, SA and SFLA have been implemented to solve non-deterministic polynomial-time hard (NP-hard) finance-based scheduling problem employing the objective of minimizing the project duration. The traditional problem of generating unfeasible solutions in scheduling problems is adequately tackled in the implementations of the meta-heuristics in this paper.

The obtained results indicated that the SA outperformed the SFLA and GA in terms of the quality of solutions as well as the computational cost based on the small-size networks of 30 activities, whereas it exhibited the least total duration based on the large-size networks of 120 and 210 activities after prolonged processing time.

From researchers’ perspective, finance-based scheduling is one of the few domain problems which can be formulated as discrete and continuous-variable optimization problems and, thus, can be used by researchers as a test bed to give more insight into the performance of new developments of meta-heuristics in solving discrete and continuous-variable optimization problems.

Finance-based scheduling discrete-variable optimization problem is of high relevance to the practitioners, as it allows schedulers to devise finance-feasible schedules of minimum duration. The minimization of project duration is focal for the minimization of time-related cost components of construction contractors including overheads, finance costs and delay penalties. Moreover, planning for the expedient project completion is a major time-management aspect of construction contractors towards the achievement of the objective of client satisfaction through the expedient delivery of the completed project for clients to start reaping the anticipated benefits.

Planning for the expedient project completion is a major time-management aspect of construction contractors towards the achievement of the objective of client satisfaction.

SFLA represents a relatively recent meta-heuristic that proved to be promising, based on its limited number of applications in the literature. This paper is to implement SFLA to solve the discrete-variable optimization problem of the finance-based scheduling and assess its performance by comparing its results against those of the GA and SA.

This paper addresses a location-routing problem (LRP) under uncertainty for providing emergency medical services (EMS) during disasters, which is formulated using a robust optimization (RO) approach. The objectives consist of minimizing relief time and the total cost including location costs and the cost of route coverage by the vehicles (ambulances and helicopters).

A shuffled frog leaping algorithm (SFLA) is developed to solve the problem and the performance is assessed using both the ε-constraint method and NSGA-II algorithm. For a more accurate validation of the proposed algorithm, the four indicators of dispersion measure (DM), mean ideal distance (MID), space measure (SM), and the number of Pareto solutions (NPS) are used.

The results obtained indicate the efficiency of the proposed algorithm within a proper computation time compared to the CPLEX solver as an exact method.

In this study, the planning horizon is not considered in the model which can affect the value of parameters such as demand. Moreover, the uncertain nature of the other parameters such as traveling time is not incorporated into the model.

The outcomes of this research are helpful for decision-makers for the planning and management of casualty transportation under uncertain environment. The proposed algorithm can obtain acceptable solutions for real-world cases.

A novel robust mixed-integer linear programming (MILP) model is proposed to formulate the problem as a LRP. To solve the problem, two efficient metaheuristic algorithms were developed to determine the optimal values of objectives and decision variables.

The purpose of this paper is to implement a simple, fast and accurate heuristic method for parameter determination of Jiles‐Atherton (JA) hysteresis model for representing magnetization in electrical steel sheets. The performance of the method is validated using measured data and comparison with previous methods.

JA model requires five parameters to represent the hysteretic behavior of ferromagnetic materials. In order to determine these parameters, measured hysteresis loop is used here to calculate a fitness function which is defined by comparing the measured and simulated magnetization loops. This fitness function is minimized by optimization algorithms.

In total, four different measured hysteresis loops are studied in this paper. Each optimization algorithm is executed 50 times to investigate the convergence, speed, and accuracy of six methods. All methods begin with the same randomly generated initial parameters. Physical boundaries are used for parameters to avoid unaccepted results. Thorough examination of results shows that the proposed method is more appropriate than previously implemented methods for the parameter determination of Jiles‐Atherton model in all studied cases. The required parameters for each optimization method are also presented.

Shuffled frog leaping algorithm (SFLA) is implemented for the first time for JA model parameter determination. The results show that SFLA is faster and more accurate in comparison with other methods. Furthermore, this algorithm is easy to implement and tune.

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.

In this work, the multi-objective optimization shuffled complex evolution is proposed. The algorithm is based on the extension of shuffled complex evolution, by incorporating two classical operators into the original algorithm: the rank ordering and crowding distance. In order to accelerate the convergence process, a Local Search strategy based on the generation of potential candidates by using Latin Hypercube method is also proposed.

The multi-objective optimization shuffled complex evolution is used to accelerate the convergence process and to reduce the number of objective function evaluations.

In general, the proposed methodology was able to solve a classical mechanical engineering problem with different characteristics. From a statistical point of view, we demonstrated that differences may exist between the proposed methodology and other evolutionary strategies concerning two different metrics (convergence and diversity), for a class of benchmark functions (ZDT functions).

The development of a new numerical method to solve multi-objective optimization problems is the major contribution.

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.