Genetic programming through bi-objective genetic algorithms with a study of a simulated moving bed process involving multiple objectives

Authors:
Brijesh Kumar Giri;Jussi Hakanen;Kaisa Miettinen;Nirupam Chakraborti
Affiliations:
Department of Metallurgical & Materials Engineering, Indian Institute of Technology, Kharagpur 721 302, India;Department of Mathematical Information Technology, P.O. Box 35 (Agora), FI-40014 University of Jyväskylä, Finland;Department of Mathematical Information Technology, P.O. Box 35 (Agora), FI-40014 University of Jyväskylä, Finland;Department of Metallurgical & Materials Engineering, Indian Institute of Technology, Kharagpur 721 302, India
Venue:
Applied Soft Computing
Year:
2013

Citing 7
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
A genetic algorithms based multi-objective neural net applied to noisy blast furnace data

Applied Soft Computing
Meta-Modeling in Multiobjective Optimization

Multiobjective Optimization
A real-coded predator-prey genetic algorithm for multiobjective optimization

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new bi-objective genetic programming (BioGP) technique has been developed for meta-modeling and applied in a chromatographic separation process using a simulated moving bed (SMB) process. The BioGP technique initially minimizes training error through a single objective optimization procedure and then a trade-off between complexity and accuracy is worked out through a genetic algorithm based bi-objective optimization strategy. A benefit of the BioGP approach is that an expert user or a decision maker (DM) can flexibly select the mathematical operations involved to construct a meta-model of desired complexity or accuracy. It is also designed to combat bloat - a perennial problem in genetic programming along with over fitting and under fitting problems. In this study the meta-models constructed for SMB reactors were compared with those obtained from an evolutionary neural network (EvoNN) developed earlier and also with a polynomial regression model. Both BioGP and EvoNN were compared for subsequent constrained bi-objective optimization studies for the SMB reactor involving four objectives. The results were also compared with the previous work in the literature. The BioGP technique produced acceptable results and is now ready for data-driven modeling and optimization studies at large.