Engineering Design optimization. The course aims at integrating traditional
design methodologies with concepts and techniques of modern optimization
theory ...
Engineering Design optimization The course aims at integrating traditional design methodologies with concepts and techniques of modern optimization theory and practice. In the course the student will learn to create an appropriate mathematical description (a simulation model) of the design problem, to formulate the optimization problem and finally to use numerical optimization techniques and computer support tools in order to solve the problem. The course has an emphasis on system design where “design" is defined in a broad context, and therefore students from diverse disciplines are welcome to attend the course.
Organisation The course is given at Linköping University by the division of Machine Design and is taught at a set of workshops at Linköping University. The dates for the workshops are 31/3-1/4, 6-7/5, 10 - 11/6 2008. Questions about the course should be addressed to the lecturers, see below.
Course content Introduction Optimization and evolutionary design. How can optimization support the design process? Optimization methods Genetic Algorithms, the Complex method, Traditional gradient based methods. Formulation of the objective function What is optimal? Aggregating multiple objectives and multi-objective optimization. Constraint handling Constraints versus objectives and different type of penalty methods. Post optimal analysis Assessing the final solution – have we really found the optima? Sensitivity analysis in order to assess system robustness Project work To use the methods and techniques thought in the course on a problem taken from the students own research project.
Literature Compendium and scientific articles
Examination Project work with written report
Lecturers Johan Ölvander,
[email protected], 013/281711. Petter Krus,
[email protected], 013/281792.
Course administration and registration Margareta Johansson,
[email protected], 013/281133.