Scribd
Upload
19 views6 pages

CMPE536 Metaheuristics: Asst. Prof. Dr. Ahmet ÜNVEREN 2016-2017 SPRING

This document provides information about the CMPE536 Metaheuristics course taught by Dr. Ahmet Ünveren in the spring 2016-2017 semester. The course will cover various metaheuristic algorithms including tabu search, simulated annealing, evolutionary algorithms, ant colony optimization, and particle swarm optimization. Students will learn about heuristics, metaheuristics, neighborhood search techniques, and performance evaluation methods. The course aims to introduce widely used metaheuristic methods for solving optimization problems in artificial intelligence and operations research.

Uploaded by

Istabnul Branch
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views6 pages

CMPE536 Metaheuristics: Asst. Prof. Dr. Ahmet ÜNVEREN 2016-2017 SPRING

This document provides information about the CMPE536 Metaheuristics course taught by Dr. Ahmet Ünveren in the spring 2016-2017 semester. The course will cover various metaheuristic algorithms including tabu search, simulated annealing, evolutionary algorithms, ant colony optimization, and particle swarm optimization. Students will learn about heuristics, metaheuristics, neighborhood search techniques, and performance evaluation methods. The course aims to introduce widely used metaheuristic methods for solving optimization problems in artificial intelligence and operations research.

Uploaded by

Istabnul Branch
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

CMPE536

METAHEURISTICS

Asst. Prof. Dr. Ahmet ÜNVEREN


2016-2017 SPRING

Dr. Ünveren 1
Practical Issues
The lecturer
Asst. Prof. Dr. Ahmet ÜNVEREN
E-mail: [email protected]
IE-A201 & CMPE201

Web-pages : cmpe.emu.edu.tr

Dr. Ünveren 2
Practical Issues
Lectures
Tuesday 8:30 - 10:20 Room CMPE128
Thursday 10:30 – 11:20 Room CMPE126

METHOD OF ASSESSMENT
Midterm 1 30 %
Midterm 2 30 %
Final 40 %

Dr. Ünveren 3
TEXTBOOKs
Colin Reeves, “Modern Heuristic Techniques for
Combinatorial Optimization”, John Wiley & Sons, 1993.
Judea Pearl, “Heuristics: Intelligent Search Strategies
for Computer Problem Solving”, Addison-Wesley, 1985.
Jason Brownlee, “Clever Algorithms: Nature-Inspired
Programming”, 2011.
Thomas Back, “Evolutionary Algorithms in Theory and
Practice”, Oxford University Press, 1996.
Lecture Notes.
Dr. Ünveren 4
CATALOGUE DESCRIPTION
Heuristics and metaheuristics,
neighborhood search,
local and global optimization,
tabu search,
greedy randomized adaptive search,
simulated annealing,
gread deluge algorithm
evolutionary algorithms,
ant-colony optimization,
Particle Swarm Optimization,
Bee Colony Optimization
hybrid methods,
performance evaluation of metaheuristics.

Dr. Ünveren 5
AIMS & OBJECTIVES
Heuristics, popularly known as rules of thumb, stand for strategies that
improve the average-case performance of problem solving task.
An efficient heuristic discovers good solutions for hard problems relatively
quickly.
Metaheuristics means heuristics for managing heuristics.
Metaheuristics control the application and interaction of one or more
heuristics searching for a better solution than any single heuristic would find
on its own.

The aim of this course is to present the nature and the power of widely used
metaheuristic methods, primarily those used in artificial intelligence and
operations research. The methods to be covered are used to solve search,
reasoning, planning and general engineering optimization problems.

The graduate students who will take this course may use many of the algorithms
Dr. Ünveren
introduced in this course in their graduate research studies. 6

You might also like