Optimizing Fenton-like process, homogeneous at neutral pH for ciprofloxacin degradation: Comparing RSM-CCD and ANN-GA

Author's accepted manuscriptAntibiotics are considered among the most non-biodegradable environmental contaminants due to their genetic resistance. Considering the importance of antibiotics removal, this study was aimed at multi-objective modeling and optimization of the Fenton-like process, homogeneous at initial circumneutral pH. Two main issues, including maximizing Ciprofloxacin (CIP) removal and minimizing sludge to iron ratio (SIR), were modeled by comparing central composite design (CCD) based on Response Surface Methodology (RSM) and hybrid Artificial Neural Network-Genetic Algorithm (ANN-GA). Results of simultaneous optimization using ethylene diamine tetraacetic acid (EDTA) revealed that at pH ≅ 7, optimal conditions for initial CIP concentration, Fe2+ concentration, [H2O2]/[Fe2+] molar ratio, initial EDTA concentration, and reaction time were 14.9 mg/L, 9.2 mM, 3.2, 0.6 mM, and 25 min, respectively. Under these optimal conditions, CIP removal and SIR were predicted at 85.2% and 2.24 (gr/M). In the next step, multilayer perceptron (MLP) and radial basis function (RBF) artificial neural networks (ANN) were developed to model CIP and SIR. It was concluded that ANN, especially multilayer perceptron (MLP-ANN) has a decent performance in predicting response values. Additionally, multi-objective optimization of the process was performed using Genetic Algorithm (GA) and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to maximize CIP removal efficiencies while minimizing SIR. NSGA-II optimization algorithm showed a reliable performance in the interaction between conflicting goals and yielded a better result than the GA algorithm. Finally, TOPSIS method with equal weights of the criteria was applied to choose the best alternative on the Pareto optimal solutions of the NSGA-II. Comparing the optimal values obtained by the multi-objective response surface optimization models (RSM-CCD) with the NSGA-II algorithm showed that the optimal variables in both models were close and, according to the absolute relative error criterion, possessed almost the same performance in the prediction of variables.acceptedVersio

Automatic surrogate model type selection during the optimization of expensive black-box problems

The use of Surrogate Based Optimization (SBO) has become commonplace for optimizing expensive black-box simulation codes. A popular SBO method is the Efficient Global Optimization (EGO) approach. However, the performance of SBO methods critically depends on the quality of the guiding surrogate. In EGO the surrogate type is usually fixed to Kriging even though this may not be optimal for all problems. In this paper the authors propose to extend the well-known EGO method with an automatic surrogate model type selection framework that is able to dynamically select the best model type (including hybrid ensembles) depending on the data available so far. Hence, the expected improvement criterion will always be based on the best approximation available at each step of the optimization process. The approach is demonstrated on a structural optimization problem, i.e., reducing the stress on a truss-like structure. Results show that the proposed algorithm consequently finds better optimums than traditional kriging-based infill optimization

Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

Robust Multi-Cellular Developmental Design

This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange "chemicals" with their neighbors during the growth process. The quantity of chemicals that a cell produces, as well as the differentiation value of the cell in the phenotype, are controlled by a Neural Network (the genotype) that takes as inputs the chemicals produced by the neighboring cells at the previous time step. In the proposed model, the number of iterations of the growth process is not pre-determined, but emerges during evolution: only organisms for which the growth process stabilizes give a phenotype (the stable state), others are declared nonviable. The optimization of the controller is done using the NEAT algorithm, that optimizes both the topology and the weights of the Neural Networks. Though each cell only receives local information from its neighbors, the experimental results of the proposed approach on the 'flags' problems (the phenotype must match a given 2D pattern) are almost as good as those of a direct regression approach using the same model with global information. Moreover, the resulting multi-cellular organisms exhibit almost perfect self-healing characteristics

Parallel Implementation of Efficient Search Schemes for the Inference of Cancer Progression Models

The emergence and development of cancer is a consequence of the accumulation over time of genomic mutations involving a specific set of genes, which provides the cancer clones with a functional selective advantage. In this work, we model the order of accumulation of such mutations during the progression, which eventually leads to the disease, by means of probabilistic graphic models, i.e., Bayesian Networks (BNs). We investigate how to perform the task of learning the structure of such BNs, according to experimental evidence, adopting a global optimization meta-heuristics. In particular, in this work we rely on Genetic Algorithms, and to strongly reduce the execution time of the inference -- which can also involve multiple repetitions to collect statistically significant assessments of the data -- we distribute the calculations using both multi-threading and a multi-node architecture. The results show that our approach is characterized by good accuracy and specificity; we also demonstrate its feasibility, thanks to a 84x reduction of the overall execution time with respect to a traditional sequential implementation