Desirability Improvement of Committee Machine to Solve Multiple Response Optimization Problems. (16th September 2013)

• Record Type: Journal Article
• Authors: Golestaneh, Seyed Jafar; Ismail, Napsiah; Ariffin, Mohd Khairol Anuar M.; Tang, Say Hong; Moslemi Naeini, Hassan
• Other Names: Oh Kyong Joo Academic Editor.
• Is Part Of: Advances in artificial neural systems. (2013)
• Publication Date: 2013-09-16
• Subjects: Neural networks (Computer science) -- Periodicals; Neural networks (Computer science); Periodicals; Electronic journals; 006.32
• DOI: 10.1155/2013/628313
• Languages: English
• ISSNs: 1687-7594

Abstract

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.