|
|
| MDP - 60x Optimum Design (M.Sc. Qualification) Academic Year 2002/2003
This graduate course covers the topics concerning the Optimum Design. Classical and Random search techniques are considered in the course. A review of random search techniques is explained including Genetic Algorithms, Simulated Annealing, and Tabu Search. A more comprehensive study of Binary Coded Genetic Algorithms as well as Real Coded Genetic Algorithms are conducted. 2nd Term
3- Assignment: (to be submitted just before the Final Exam.) Apply the Real-Coded Genetic Algorithms to minimize the function: f(x, y, z) = cos(x)*exp(-0.05x) + (y/3)^2 + z^2 0.5 ≤ x ≤ 6.3 1.2 ≤ y ≤ 5.6 3.5 ≤ z ≤ 11.4 If the population size is taken as 6, for only one generation, you are required to do the following: a) Perform roulette wheel selection for the selection of the temporary generation, b) Apply arithmetical crossover for a randomly selected two chromosomes, c) Apply simple crossover for other randomly selected two chromosomes, d) Apply boundary mutation for one of the remaining two chromosomes. e) Apply uniform mutation for the remaining chromosome. Check grades 1- http://cs.felk.cvut.cz/~xobitko/ga/ 2- Deb, K. and Goyal, M., “Optimizing Engineering Designs Using a Combined Genetic Search”, Proceedings of the 7th International Conference on Genetic Algorithms, East Lansing, MI, pp. 521-528, 1997. 3-Fogel, D.B., “Evolutionary Computation, Toward a New Philosophy of Machine Intelligence”, (Chapter 3, Computer Simulation of Natural Evolution), IEEE press, 1997. 4- Gen, M., Cheng, R., “Genetic Algorithms and Engineering Design”, John Wiley & Sons, Inc., 1997. 5- Goldberg, D.E., “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison-Wesley, Reading, MA, 1989. 6- Goldberg, D.E., “Real-Coded Genetic Algorithms, Virtual Alphabets and Blocking”, Complex Systems, Vol. 5, pp. 139-167, 1991. 7- Herrera, F., Lozano, M. and Verdegay, J.L., "Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis'', Artificial Intelligence Review, Vol. 12, pp. 265–319, 1998. 8- Krottmaier, J., “Optimizing Engineering Designs”, (Chapter10, Genetic Algorithms), McGraw-Hill Comp., 1993. 9-Lin, Y-J, Noah, S.T., “Using Genetic Algorithms For The Optimal Design of Fluid Journal Bearing”, Proceedings of the 1999 ASME Design Engineering Technical Conferences Sep 12-15,Paper No. DETC99/VIB-8171, 1999. 10- Nassef, A.O., “Random Search Optimization Techniques”, Printed notes, Pre-Master courses, Cairo University, 2002. 11- Nassef, A.O., Hegazi. H.A. and Metwalli, S.M., “Design of C-frames Using Real-Coded Genetic Optimization Algorithms And NURBS”, Proceedings of the 1999 ASME Computers in Engineering Conference, Las Vegas, NE, 1999. 12- Nassef, A.O., Hegazi. H.A. and Metwalli, S.M., “A Hybrid Genetic-Direct Search Algorithm for the Shape Optimization of Solid C-frame Cross-Sections”, Proceedings of the 2000 ASME Design Automation Conference, Baltimore, Maryland, 2000. 13- Rao, S.S., “Engineering Optimization, Theory and Practice”, Third Edition, John Wiley and Sons, Inc, 1996. 14- Seireg, A.A., Rodriguez, J., “Optimizing the Shape of Mechanical Elements and Structure”, Marcel Dekker, Inc., 1997. |