Abstract
In engineering design problems, designers set boundaries of design variables and solve the system to find the design variables that satisfy a target performance. Once lower and upper bounds for each performance index are set, the design problem becomes Constraint Satisfaction Problem (CSP). In this paper, CSP problem is transformed into an optimization problem with a penalty function. Also, by applying optimization technique, set of feasible solutions are acquired. The set of solutions and all the function evaluation during the iteration process are stored in database. By utilizing a database query, the best solution among the data points are selected for the design problem. For the numerical experiment, a CSP with three variables and a bicycle model of vehicle design is tested with different scenarios.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
