Structural health monitoring of railway tracks using IoT-based multi-robot system

Neural Computing and Applications - A multi-robot-based fault detection system for railway tracks is proposed to eliminate manual human visual inspection. A hardware prototype is designed to...     

A quantum mutation-based backtracking search algorithm

The exposition of any nature-inspired optimization technique relies firmly upon its executed organized framework. Since the regularly utilized backtracking search algorithm (BSA) is a fixed framework, it is not always appropriate for all difficulty levels of problems and, in this manner, probably does not search the entire search space proficiently. To address this limitation, we propose a modified BSA framework, called gQR-BSA, based on the quasi reflection-based initialization, quantum Gaussian mutations, adaptive parameter execution, and quasi-reflection-based jumping to change the coordinate structure of the BSA. In gQR-BSA, a quantum Gaussian mechanism was developed based on the best population information mechanism to boost the population distribution information. As population distribution data can represent characteristics of a function landscape, gQR-BSA has the ability to distinguish the methodology of the landscape in the quasi-reflection-based jumping. The updated automatically managed parameter control framework is also connected to the proposed algorithm. In every iteration, the quasi-reflection-based jumps aim to jump from local optima and are adaptively modified based on knowledge obtained from offspring to global optimum. Herein, the proposed gQR-BSA was utilized to solve three sets of well-known standards of functions, including unimodal, multimodal, and multimodal fixed dimensions, and to solve three well-known engineering optimization problems. The numerical and experimental results reveal that the algorithm can obtain highly efficient solutions to both benchmark and real-life optimization problems.

     

Multi expression programming: a new approach to formulation of soil classification

This paper presents an alternative approach to formulation of soil classification by means of a promising variant of genetic programming (GP), namely multi expression programming (MEP). Properties of soil, namely plastic limit, liquid limit, color of soil, percentages of gravel, sand, and fine-grained particles are used as input variables to predict the classification of soils. The models are developed using a reliable database obtained from the previously published literature. The results demonstrate that the MEP-based formulas are able to predict the target values to high degree of accuracy. The MEP-based formulation results are found to be more accurate compared with numerical and analytical results obtained by other researchers.     

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.     

Evolutionary boundary constraint handling scheme

The performance of an optimization tool is largely determined by the efficiency of the search algorithms used in the process as well as the proper handling of complex constraints. From the implementation point of view, an important part of task ensuring an efficient algorithm to work to its best capability is to handle the boundary constraints properly and effectively. As most studies in the literature have focused on the development of algorithms and performance evaluation and comparison of optimization algorithms, this crucial step has not been explored very well, and consequently only limited studies have been carried out in this field. This paper intends to propose a simple and yet efficient evolutionary scheme for handling boundary constraints. The simplicity of this approach means that the proposed scheme is very easy to implement and thus can be suitable for many applications. We demonstrate this approach with an efficient algorithm, differential evolution, and we also compare it with other boundary constraint handling approaches for a wide set of benchmark problems. Based on statistical parameters and especially mean values, the results obtained by the evolutionary scheme are better than the best known solutions obtained by the existing methods.     

Design equations for prediction of pressuremeter soil deformation moduli utilizing expression programming systems

Providing precise estimations of soil deformation modulus is very difficult due to its dependence on many factors. In this study, gene expression programming (GEP) and multi-expression programming (MEP) systems are presented to derive empirical equations for the prediction of the pressuremeter soil deformation modulus. The employed expression programming (EP) systems formulate the soil deformation modulus in terms of the soil physical properties. Selection of the best models is on the basis of developing and controlling several models with different combinations of the affecting parameters. The proposed EP-based models are established upon 114 pressuremeter tests on different soil types conducted in this study. The generalization capabilities of the models are verified using several statistical criteria. Contributions of the variables influencing the soil modulus are evaluated through a sensitivity analysis. The GEP and MEP approaches accurately characterize the soil deformation modulus resulting in a very good prediction performance. The result indicates that moisture content and soil dry unit weight can efficiently represent the initial state and consolidation history of soil for determining its modulus.     

Discussion on “Enhancement of combined heat and power economic dispatch using self adaptive real-coded genetic algorithm,by P. Subbaraj et al., Applied Energy 86 (2009) 915–921.”

The paper studied by Subbaraj et al. (2009) considers the feasibility of using self adaptive real-coded genetic algorithm for enhancement of combined heat and power economic dispatch. The paper includes some problems about the considered feasible operating region. In this discussion, the controversial point of the paper are given.     

Design optimization of truss structures using cuckoo search algorithm

A new metaheuristic optimization algorithm is developed to solve truss optimization problems. The new algorithm, called cuckoo search (CS), is examined by solving five truss design optimization problems with increasing numbers of design variables and complexity in constraints. The performance of the CS algorithm is further compared with various classical and advanced algorithms, selected from a wide range of the state‐of‐the‐art algorithms in the area. The results identify that the final solutions obtained by the CS are superior compared with the best solutions obtained by the other algorithms. Finally, the unique search features used in the CS and the implications for future researches are discussed in detail. Copyright © 2012 John Wiley & Sons, Ltd.