About this Journal Submit a Manuscript Table of Contents
Advances in Artificial Neural Systems
Volume 2013 (2013), Article ID 628313, 9 pages
http://dx.doi.org/10.1155/2013/628313
Research Article

Desirability Improvement of Committee Machine to Solve Multiple Response Optimization Problems

1Department of Mechanical and Manufacturing Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
2Faculty of Engineering, Tarbiat Modares University, P.O. Box 14155-143, Tehran 1411713116, Iran

Received 28 February 2013; Accepted 8 August 2013

Academic Editor: Kyong Joo Oh

Copyright © 2013 Seyed Jafar Golestaneh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Multiple response optimization (MRO) problems are usually solved in three phases that include experiment design, modeling, and optimization. Committee machine (CM) as a set of some experts such as some artificial neural networks (ANNs) is used for modeling phase. Also, the optimization phase is done with different optimization techniques such as genetic algorithm (GA). The current paper is a development of recent authors' work on application of CM in MRO problem solving. In the modeling phase, the CM weights are determined with GA in which its fitness function is minimizing the RMSE. Then, in the optimization phase, the GA specifies the final response with the object to maximize the global desirability. Due to the fact that GA has a stochastic nature, it usually finds the response points near to optimum. Therefore, the performance the algorithm for several times will yield different responses with different GD values. This study includes a committee machine with four different ANNs. The algorithm was implemented on five case studies and the results represent for selected cases, when number of performances is equal to five, increasing in maximum GD with respect to average value of GD will be eleven percent. Increasing repeat number from five to forty-five will raise the maximum GD by only about three percent more. Consequently, the economic run number of the algorithm is five.