ARO: A new model free optimization algorithm for real time applications inspired by the asexual reproduction

This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA.     

Genetic-based minimum classification error mapping for accurate identifying Peer-to-Peer applications in the internet traffic

In this paper, we propose a hybrid approach using genetic algorithm and neural networks to classify Peer-to-Peer (P2P) traffic in IP networks. We first compute the minimum classification error (MCE) matrix using genetic algorithm. The MCE matrix is then used during the pre-processing step to map the original dataset into a new space. The mapped data set is then fed to three different classifiers: distance-based, K-Nearest Neighbors, and neural networks classifiers. We measure three different indexes, namely mutual information, Dunn, and SD to evaluate the extent of separation of the data points before and after mapping is performed. The experimental results demonstrate that with the proposed mapping scheme we achieve, on average, 8% higher accuracy in classification of the P2P traffic compare to the previous solutions. Moreover, the genetic-based MCE matrix increases the classification accuracy more than what the basic MCE does.     

Simultaneous state estimation and parameter identification in linear fractional order systems using coloured measurement noise

In the present paper, the identification and estimation problem of a single-input–single-output (SISO) fractional order state-space system will be addressed. A SISO state-space model is considered in which parameters and also state variables should be estimated. The canonical fractional order state-space system will be transformed into a regression equation by using a linear transformation and a shift operator that are appropriate for identification. The identification method provided in this paper is based on a recursive identification algorithm that has the capability of identifying the parameters of fractional order state-space system recursively. Another subject that will be addressed in this paper is a novel fractional order Kalman filter suitable for the systems with coloured measurement noise. The promising performance of the proposed methods is verified using two stable fractional order systems.     

Extreme learning machine assessment for estimating sediment transport in open channels

The minimum velocity required to prevent sediment deposition in open channels is examined in this study. The parameters affecting transport are first determined and then categorized into different dimensionless groups, including “movement,” “transport,” “sediment,” “transport mode,” and “flow resistance.” Six different models are presented to identify the effect of each of these parameters. The feed-forward neural network (FFNN) is used to predict the densimetric Froude number (Fr) and the extreme learning machine (ELM) algorithm is utilized to train it. The results of this algorithm are compared with back propagation (BP), genetic programming (GP) and existing sediment transport equations. The results indicate that FFNN-ELM produced better results than FNN-BP, GP and existing sediment transport methods in both training (RMSE = 0.26 and MARE = 0.052) and testing (RMSE = 0.121 and MARE = 0.023). Moreover, the performance of FFNN-ELM is examined for different pipe diameters.     

Design of sliding mode and model reference adaptive control strategies for multivariable tape transport mechanism: a performance comparison

This paper presents sliding mode control and model reference adaptive control strategies for the tape transport mechanism. A nonlinear multivariable MIMO model of the process, consisting of take-up and supply reel servos for tape tension control and capstan servo for speed control is considered. The sliding mode control is applied for the nonlinear dynamic model of the process, while the model reference adaptive control deals with the linearized one. Moreover, in order to associate with the realistic model of system, design of controllers is accomplished with respect to parametric uncertainties. It is shown that both control strategies can guarantee asymptotic stability of the closed-loop system and tracking of desired outputs with the appropriate pace in the presence of uncertainties. Finally, simulation results demonstrate the effectiveness of the proposed controllers.     

Multi-stage genetic programming: A new strategy to nonlinear system modeling

This paper presents a new multi-stage genetic programming (MSGP) strategy for modeling nonlinear systems. The proposed strategy is based on incorporating the individual effect of predictor variables and the interactions among them to provide more accurate simulations. According to the MSGP strategy, an efficient formulation for a problem comprises different terms. In the first stage of the MSGP-based analysis, the output variable is formulated in terms of an influencing variable. Thereafter, the error between the actual and the predicted value is formulated in terms of a new variable. Finally, the interaction term is derived by formulating the difference between the actual values and the values predicted by the individually developed terms. The capabilities of MSGP are illustrated by applying it to the formulation of different complex engineering problems. The problems analyzed herein include the following: (i) simulation of pH neutralization process, (ii) prediction of surface roughness in end milling, and (iii) classification of soil liquefaction conditions. The validity of the proposed strategy is confirmed by applying the derived models to the parts of the experimental results that were not included in the analyses. Further, the external validation of the models is verified using several statistical criteria recommended by other researchers. The MSGP-based solutions are capable of effectively simulating the nonlinear behavior of the investigated systems. The results of MSGP are found to be more accurate than those of standard GP and artificial neural network-based models.     

Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip

Network-on-chip-based multiprocessor systems-on-chip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resource-utilization is improved when compared to existing techniques.     

Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional approaches. Therefore, a new multi-objective shuffled frog-leaping algorithm (MOSFLA) is introduced for the first time to search locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with three distinguished multi-objective genetic algorithms, i.e. PS-NC GA, NSGA-II, and SPEA-II. The computational results show that the proposed MOSFLA performs better than the above genetic algorithms, especially for the large-sized problems.