|
Language of Instruction
|
English
|
|
Level of Course Unit
|
Bachelor's Degree
|
|
Department / Program
|
INDUSTRIAL ENGINEERING
|
|
Type of Program
|
Formal Education
|
|
Type of Course Unit
|
Elective
|
|
Course Delivery Method
|
Face To Face
|
|
Objectives of the Course
|
To introduce the main heuristic search methods
To learn the use of these methods to real life problems
|
|
Course Content
|
Heuristics are methods that seek a fine, but not necessarily optimal solution in a reasonable amount of time. This course will survey a wide range of heuristic methods (greedy heuristics, improvement heuristics constructive heuristics, metaheuristics: simulated annealing, tabu search, genetic algorithms, ant colony optimization), emphasizing their generic characteristics and limitations, and the types of problems to which they are best adapted.
|
|
Course Methods and Techniques
|
In class activities, Term Projects, Case Studies
|
|
Prerequisites and co-requisities
|
None
|
|
Course Coordinator
|
None
|
|
Name of Lecturers
|
Asist Prof.Dr. Betül Çoban
|
|
Assistants
|
None
|
|
Work Placement(s)
|
No
|
Recommended or Required Reading
|
Resources
|
• El-Ghazali Talbi – Metaheuristics from design to Implementation-Wiley (2009) • Essentials of Metaheuristics, Luke S., 2016. • Metaheuristics for Hard Optimization, Dreo, Petrowski, Siarry and Taillard, 2003, ISBN-13 978-3-540-23022-9 Springer Berlin Heidelberg New York
|
|
|
• El-Ghazali Talbi – Metaheuristics from design to Implementation-Wiley (2009)
• Essentials of Metaheuristics, Luke S., 2016.
• Metaheuristics for Hard Optimization, Dreo, Petrowski, Siarry and Taillard, 2003, ISBN-13 978-3-540-23022-9 Springer Berlin Heidelberg New York
|
|
|
canvas
|
|
|
canvas
|
|
|
canvas
|
|