Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
INS 587SOLUTION OF CIVIL ENGINEERING PROBLEMS USING HEURISTIC OPTIMIZATION ALGORITHMS3 + 02nd Semester7,5

COURSE DESCRIPTION
Course Level Master's Degree
Course Type Elective
Course Objective The aim of this course is to provide an advanced information about heuristic optimization algorithms.
Course Content Introduction to optimization, Constrained and unconstrained optimization problems, Continuous and Discrete optimization, Genetic Algorithms, Harmony Search, Particle Swarm Optimization, Differential Evolution Algorithm, Heuristic operators, Solution of constrained optimization problems using penalty function approach, Software development and solution of optimization problems dealing with civil engineering
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1It provides an information about mathematical optimization.
2It gives information dealing with unconstrained-constrained, continuous-discrete optimization problems.
3It provides information about genetic algorithms, harmony search, and particle swarm optimization algorithms.
4It provides information about how to solve the constrained optimization problems through heuristic optimization algorithms.
5It provides coding the required softwares to solve the optimization problems through heuristic optimization algorithms.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11
LO 0011   23   45
LO 0021   23   45
LO 003  1 23   54
LO 004  4251    2
LO 0051 32    54 
Sub Total3 841110  51716
Contribution10212200133

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14342
Assignments23060
Mid-terms12525
Final examination12626
Total Work Load

ECTS Credit of the Course






195

7,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Spring1MUSTAFA TAMER AYVAZ
Details 2022-2023 Fall1MUSTAFA TAMER AYVAZ
Details 2021-2022 Fall1MUSTAFA TAMER AYVAZ
Details 2020-2021 Fall1MUSTAFA TAMER AYVAZ
Details 2019-2020 Spring1MUSTAFA TAMER AYVAZ
Details 2019-2020 Fall1MUSTAFA TAMER AYVAZ
Details 2018-2019 Spring1MUSTAFA TAMER AYVAZ
Details 2018-2019 Fall1MUSTAFA TAMER AYVAZ
Details 2017-2018 Fall1MUSTAFA TAMER AYVAZ
Details 2016-2017 Spring1MUSTAFA TAMER AYVAZ
Details 2016-2017 Fall1MUSTAFA TAMER AYVAZ
Details 2015-2016 Fall1MUSTAFA TAMER AYVAZ
Details 2014-2015 Spring1MUSTAFA TAMER AYVAZ
Details 2014-2015 Fall1MUSTAFA TAMER AYVAZ
Details 2013-2014 Spring1MUSTAFA TAMER AYVAZ
Details 2013-2014 Fall1MUSTAFA TAMER AYVAZ
Details 2012-2013 Spring1MUSTAFA TAMER AYVAZ
Details 2011-2012 Fall1MUSTAFA TAMER AYVAZ
Details 2010-2011 Fall1MUSTAFA TAMER AYVAZ


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
INS 587 SOLUTION OF CIVIL ENGINEERING PROBLEMS USING HEURISTIC OPTIMIZATION ALGORITHMS 3 + 0 1 Turkish 2023-2024 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. MUSTAFA TAMER AYVAZ tayvaz@pau.edu.tr MUH BA0114 %
Goals The aim of this course is to provide an advanced information about heuristic optimization algorithms.
Content Introduction to optimization, Constrained and unconstrained optimization problems, Continuous and Discrete optimization, Genetic Algorithms, Harmony Search, Particle Swarm Optimization, Differential Evolution Algorithm, Heuristic operators, Solution of constrained optimization problems using penalty function approach, Software development and solution of optimization problems dealing with civil engineering
Topics
WeeksTopics
1 Introduction to optimization, constrained and unconstrained optimization, continuous and discrete optimization problems
2 Introduction to nonlinear programming, iterative search process, determination of step size and search direction, Steepest-descent algorithm
3 Conjugate gradient method, Newton's method, Modified Newton's method, Quasi-Newton method, BFGS method
4 Introduction to heuristic optimization, Properties of heuristic optimization algorithms, comparison of heuristic and ohter optimization algorithms
5 Introduction to genetic algorithms, definition of decision variables using chromosomes, generation of initial population
6 Selection, crossover and mutation operators in genetic algorithm, evaluation process
7 Software development and solution of optimization problems dealing with civil engineering
8 Introduction to Harmony search optimization algorithm, Analogy between musical improvisation and optimization, definition of solution steps
9 Software development and solution of optimization problems dealing with civil engineering
10 Introduction of particle swarm optimization, Analogy between swarm intelligence and optimization, definition of solution steps
11 Software development and solution of optimization problems dealing with civil engineering
12 Solution of constrained optimization problems with heuristic algorithms, penalty function approach
13 Application of different penalty functions
14 Presentation of term projects
Materials
Materials are not specified.
Resources
ResourcesResources Language
Derviş Karaboğa, Yapay Zeka Optimizasyon Algoritmaları, Atlas Yayın Dağıtım, 2004Türkçe
Jasbir S. Arora, Introduction to Optimum Design, Elsevier Academic Press, 2004English
Singiresu S. Rao, Engineering Optimization - Theory and Practice, John Wiley, 2009English
D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Pub. Co., 1989.English
Mitsuo Gen, Runwei Cheng, Genetic Algorithms and Engineering Design, John Wiley, 1997.English
Zong Woo Geem, Music-Inspired Harmony Search Algorithm - Theory and Applications, Springer, 2009.English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes