A modified Intelligent Water Drops algorithm and its application to optimization problems

The Intelligent Water Drop (IWD) algorithm is a recent stochastic swarm-based method that is useful for solving combinatorial and function optimization problems. In this paper, we investigate the effectiveness of the selection method in the solution construction phase of the IWD algorithm. Instead of the fitness proportionate selection method in the original IWD algorithm, two ranking-based selection methods, namely linear ranking and exponential ranking, are proposed. Both ranking-based selection methods aim to solve the identified limitations of the fitness proportionate selection method as well as to enable the IWD algorithm to escape from local optima and ensure its search diversity. To evaluate the usefulness of the proposed ranking-based selection methods, a series of experiments pertaining to three combinatorial optimization problems, i.e., rough set feature subset selection, multiple knapsack and travelling salesman problems, is conducted. The results demonstrate that the exponential ranking selection method is able to preserve the search diversity, therefore improving the performance of the IWD algorithm. © 2014 Elsevier Ltd. All rights reserved.

Optimization of milling parameters on the synthesis of stearic acid coated CaCO3 nanoparticles

Surface modification of precipitated calcium carbonate particles (calcite) in a planetary ball mill using stearic acid as a modification agent for making dispersion in hydrocarbon oil was investigated. Different parameters for processing (milling) such as milling time, ball-to-sample ratio, and molar ratio of the reactant were varied and analyzed for optimization. The physical properties of the hydrophobically modified calcium carbonate particles were measured; the particle size and morphology of the resulting samples were characterized by transmission electron microscopy and X-ray diffraction. The surface coating thickness was estimated using small angle X-ray scattering. © 2014 American Coatings Association & Oil and Colour Chemists' Association.

Application of cuckoo search for design optimization of heat exchangers

A wide variety of evolutionary optimization algorithms have been used by researcher for optimal design of shell and tube heat exchangers (STHX). The purpose of optimization is to minimize capital and operational costs subject to efficiency constraints. This paper comprehensively examines performance of genetic algorithm (GA) and cuckoo search (CS) for solving STHX design optimization. While GA has been widely adopted in the last decade for STHX optimal design, there is no report on application of CS method for this purpose. Simulation results in this paper demonstrate that CS greatly outperforms GA in terms of finding admissible and optimal configurations for STHX. It is also found that CS method not only has a lower computational requirement, but also generates the most consistent results.

Intelligent facial emotion recognition using a layered encoding cascade optimization model

In this research, we propose a facial expression recognition system with a layered encoding cascade optimization model. Since generating an effective facial representation is a vital step to the success of facial emotion recognition, a modified Local Gabor Binary Pattern operator is first employed to derive a refined initial face representation and we then propose two evolutionary algorithms for feature optimization including (i) direct similarity and (ii) Pareto-based feature selection, under the layered cascade model. The direct similarity feature selection considers characteristics within the same emotion category that give the minimum within-class variation while the Pareto-based feature optimization focuses on features that best represent each expression category and at the same time provide the most distinctions to other expressions. Both a neural network and an ensemble classifier with weighted majority vote are implemented for the recognition of seven expressions based on the selected optimized features. The ensemble model also automatically updates itself with the most recent concepts in the data. Evaluated with the Cohn-Kanade database, our system achieves the best accuracies when the ensemble classifier is applied, and outperforms other research reported in the literature with 96.8% for direct similarity based optimization and 97.4% for the Pareto-based feature selection. Cross-database evaluation with frontal images from the MMI database has also been conducted to further prove system efficiency where it achieves 97.5% for Pareto-based approach and 90.7% for direct similarity-based feature selection and outperforms related research for MMI. When evaluated with 90° side-view images extracted from the videos of the MMI database, the system achieves superior performances with >80% accuracies for both optimization algorithms. Experiments with other weighting and meta-learning combination methods for the construction of ensembles are also explored with our proposed ensemble showing great adpativity to new test data stream for cross-database evaluation. In future work, we aim to incorporate other filtering techniques and evolutionary algorithms into the optimization models to further enhance the recognition performance.

Dynamic prediction models and optimization of polyacrylonitrile (PAN) stabilization processes for production of carbon fiber

Thermal stabilization process of polyacrylonitrile (PAN) is the slowest and the most energy-consuming step in carbon fiber production. As such, in industrial production of carbonfiber, this step is considered as amajor bottleneck in the whole process. Stabilization process parameters are usually many in number and highly constrained, leading to high uncertainty. The goal of this paper is to study and analyze the carbon fiber thermal stabilization process through presenting several effective dynamic models for the prediction of the process. The key point with using dynamic models is that using an evolutionary search technique, the heat of reaction can be optimized. The employed components of the study are Levenberg–Marquardt algorithm (LMA)-neural network (LMA-NN), Gauss–Newton (GN)-curve fitting, Taylor polynomial method, and a genetic algorithm. The results show that the procedure can effectively optimize a given PAN fiber heat of reaction based on determining the proper values of heating rampand temperature

An ensemble of intelligent water drop algorithms and its application to optimization problems

Crown Copyright © 2015 Published by Elsevier Inc. All rights reserved. The Intelligent Water Drop (IWD) algorithm is a recent stochastic swarm-based method that is useful for solving combinatorial and function optimization problems. In this paper, we propose an IWD ensemble known as the Master-River, Multiple-Creek IWD (MRMC-IWD) model, which serves as an extension of the modified IWD algorithm. The MRMC-IWD model aims to improve the exploration capability of the modified IWD algorithm. It comprises a master river which cooperates with multiple independent creeks to undertake optimization problems based on the divide-and-conquer strategy. A technique to decompose the original problem into a number of sub-problems is first devised. Each sub-problem is then assigned to a creek, while the overall solution is handled by the master river. To empower the exploitation capability, a hybrid MRMC-IWD model is introduced. It integrates the iterative improvement local search method with the MRMC-IWD model to allow a local search to be conducted, therefore enhancing the quality of solutions provided by the master river. To evaluate the effectiveness of the proposed models, a series of experiments pertaining to two combinatorial problems, i.e., the travelling salesman problem (TSP) and rough set feature subset selection (RSFS), are conducted. The results indicate that the MRMC-IWD model can satisfactorily solve optimization problems using the divide-and-conquer strategy. By incorporating a local search method, the resulting hybrid MRMC-IWD model not only is able to balance exploration and exploitation, but also to enable convergence towards the optimal solutions, by employing a local search method. In all seven selected TSPLIB problems, the hybrid MRMC-IWD model achieves good results, with an average deviation of 0.021% from the best known optimal tour lengths. Compared with other state-of-the-art methods, the hybrid MRMC-IWD model produces the best results (i.e. the shortest and uniform reducts of 20 runs) for all13 selected RSFS problems.