Title:

Applied Evolutionary Algorithms

Code:EVO
Ac.Year:2009/2010
Term:Summer
Study plans:
ProgramBranchYearDuty
IT-MSC-2MBI1stCompulsory-Elective - group I
IT-MSC-2MBS-Elective
IT-MSC-2MGM-Elective
IT-MSC-2MGM.-Elective
IT-MSC-2MIN-Elective
IT-MSC-2MIN.-Elective
IT-MSC-2MIS-Elective
IT-MSC-2MIS.-Elective
IT-MSC-2MMI-Elective
IT-MSC-2MMM-Elective
IT-MSC-2MPS1stElective
IT-MSC-2MPV2ndCompulsory-Elective - group B
IT-MSC-2MSK-Elective
IT-MSC-2EITE2ndElective
Language:Czech
Private info:http://www.fit.vutbr.cz/study/courses/EVO/private/
Credits:5
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:2600818
 ExaminationTestsExercisesLaboratoriesOther
Points:50180824
Guarantee:Schwarz Josef, doc. Ing., CSc., DCSY
Lecturer:Schwarz Josef, doc. Ing., CSc., DCSY
Instructor:Jaroš Jiří, Ing., Ph.D., DCSY
Pospíchal Petr, Ing., DCSY
Faculty:Faculty of Information Technology BUT
Department:Department of Computer Systems FIT BUT
Substitute for:
Applied Evolutionary Algorithms (EVA), DCSY
 
Learning objectives:
Survey about actual optimization techniques and evolutionary algorithms for solution of complex, NP complete problems. To make students familiar with software tools for fast prototyping of evolutionary algorithms and learn how to solve typical complex tasks from engineering practice.
Description:
Multiobjective optimization problems, standard approaches and stochastic evolutionary algorithms (EA), simulated annealing (SA). Evolution strategies (ES) and genetic algorithms (GA). Tools for fast prototyping. Representation of problems by graph models. Evolutionary algorithms in engineering applications namely in synthesis and physical design of digital circuits, artificial intelligence, signal processing, scheduling in multiprocessor systems and in business commercial applications.
Learning outcomes and competences:
Ability of problem formulation for the solution on the base of evolutionary computation. Knowledge of methodology of fast prototyping of evolutionary optimizer utilizing GA library and present design tools.
Syllabus of lectures:
  1. Evolutionary algorithms, theoretical foundation, basic distribution (GA, EP,GP, ES).
  2. Genetic algorithms (GA), schemata theory.
  3. Genetic algorithms using diploids and messy-chromozomes. Specific crossing.
  4. Repesentative combinatorial optimization problems.
  5. Evolutionary programming, Hill cimbing algorithm, Simulated annealing. 
  6. Genetic programming.
  7. Advanced estimation distribution algorithms (EDA).
  8. Variants of EDA algorithms, UMDA, BMDA and BOA.
  9. Multimodal and multicriterial optimization.
  10. Dynamoc optimization problems.
  11. New evolutionary paradigm: immune systems,  differential evolution, SOMA.
  12. Differential evolution. Particle swarm model. 
  13. Ingeneering tasks and evolutionary algorithms.

 

Syllabus of laboratory exercises:
  1. Simple design of an optimizer with GADesign system.
  2. Utilizing of GA libraries like GAlib.
  3. Genetic programming in Java.
  4. Illustration of the program BMDA.

 

Syllabus - others, projects and individual work of students:
  1. Program for the optimization of given problem on the base of evolutionary computation.
Fundamental literature:
  1. Kvasnička V., Pospíchal J.,Tiňo P.: Evolutionary algorithms. Publisher STU Bratislava, 2000, pp. 215, ISBN 80-227-1377-5.
  2. Dasgupta D., Michalewicz Z.: Evolutionary algorithms in engineering applications. Springer Verlag, Berlin, 1997, ISBN 3-540-62021-4.
  3. Back, J: Evolutionary algorithms, theory and practice, New York, 1996.
Study literature:
  1. Kvasnička V., Pospíchal J.,Tiňo P.: Evolutionary algorithms. Publisher STU Bratislava, 2000, pp. 215, ISBN 80-227-1377-5.
  2. Kvasnička V., a kol.: Introduction into theory of neural networks, Iris 1997, ISBN 80-88778-30-1.
Progress assessment:
Midterm and final test, one project.