Higher Desirability in Solving Multiple Response Optimization Problems with Committee Machine
نویسندگان
چکیده
منابع مشابه
Improvement of Committee Machine Performance to Solve Multiple Response Optimization Problems
Three phases are considered for multiple response optimization (MRO) problems. They are design of experiments, modeling and optimization. Committee machines (CM) as a set of some experts such as some artificial neural networks (ANNs) can be applied for modeling phase. Then, genetic algorithm (GA) determines the final solution with object maximizing the global desirability as optimization phase....
متن کاملOn Multiple Response Optimization: Desirability Functions and Artificial Neural Networks
There are several different approaches used for the optimization of multiple response surface problems. Recently desirability functions and neural network approaches are used in many related studies. In this study multiple response optimization is investigated using desirability functions in response surface methodology and artificial neural networks. The results of these approaches are investi...
متن کاملRobust Optimal Desirability Approach for Multiple Responses Optimization with Multiple Productions Scenarios
An optimal desirability function method is proposed to optimize multiple responses in multiple production scenarios, simultaneously. In dynamic environments, changes in production requirements in each condition create different production scenarios. Therefore, in multiple production scenarios like producing in several production lines with different technologies in a factory, various fitted r...
متن کاملIMPORTANT ISSUES IN MULTIPLE RESPONSE OPTIMIZATION
There have been many productive methods developed so far for optimization of multiple response surface (MRS) problems. This paper tends to review the most seminal approaches in MRS and discuss the strength and weakness of each of the approaches through existing aspects in MRS. A numerical example is included to compare results by different methods. Finally some of the prominent areas for future...
متن کاملSolving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different application domains, including planning and formal verification. The main reason for this success is that modern SAT solvers can successfully deal with problems having millions of variables. All these solvers are based on the D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mechanics and Materials
سال: 2014
ISSN: 1662-7482
DOI: 10.4028/www.scientific.net/amm.564.608