Application of permutation genetic algorithm for sequential model building–model validation design of experiments
Mohammed Reza Kianifar, Felician Campean, Alastair S. Wood · Soft Computing · 2015
The work presented in this paper is motivated by a complex multivariate engineering problem associated with engine mapping experiments, which require efficient design of experiments (DoE) strategies to minimise expensive testing. The paper describes the development and evaluation of a Permutation Genetic Algorithm (PermGA) to enable an exploration-based sequential DoE strategy for complex real-life engineering problems. A known PermGA was implemented to generate uniform OLH DoEs, and substantially extended to support generation of model building–model validation (MB–MV) sequences, by generating optimal infill sets of test points as OLH DoEs that preserve good space-filling and projection properties for the merged MB + MV test plan. The algorithm was further extended to address issues with non-orthogonal design spaces, which is a common problem in engineering applications. The effectiveness of the PermGA algorithm for the MB–MV OLH DoE sequence was evaluated through a theoretical benchmark problem based on the Six-Hump-Camel-Back function, as well as the Gasoline Direct Injection engine steady-state engine mapping problem that motivated this research. The case studies show that the algorithm is effective in delivering quasi-orthogonal space-filling DoEs with good properties even after several MB–MV iterations, while the improvement in model adequacy and accuracy can be monitored by the engineering analyst. The practical importance of this work, demonstrated through the engine case study, is that significant reduction in the effort and cost of testing can be achieved.