DM812 (5 ECTS - 2nd Quarter) Metaheuristics Metaheuristikker DM811 (5 ECTS - 1st Quarter) Heuristics for Combinatorial Optimization Heuristikker og lokalsøgningsalgoritmer for kombinatorisk optimering Marco Chiarandini adjunkt, IMADA www.imada.sdu.dk/~marco/
22
Embed
Heuristics for Combinatorial Optimizationmarco/Teaching/Fall2008/DM811/Slides/DM8… · DM811 Heuristics for Combinatorial Optimization - L0 Course Material ‣ Text book-Search methodologies:
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
‣ Get inspired by approach to problem-solving in human mind
- trial and error
‣ and by apparent simplicity of processes in nature
- evolutionary theory, swarm intelligence
Heuristics: algorithms to compute, efficiently, good or optimal solutions to a problem, but not guaranteed to do so.
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0Heuristics as Science
Empirical studies
Theoretical studies
They aim at understanding:
‣ general and/or problem specific ideas that work
‣ how they can be efficiently implemented in computers
‣ what makes one succeed and some not
‣ which are the theoretical limits
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0Heuristics as Engineering
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0Contents of the course
1. Introduction, Overview and Terminology2. Basic Methods and Algorithms3. Integer Programming, Branch and Bound, LP Rounding4. Constraint Programming and Complete Search5. Approximation Algorithms6. Greedy Methods and Extensions7. Local Search8. Very Large Scale Neighborhoods9. Stochastic Local Search10. Stochastic Local Search II11. Experimental analysis and configuration tools12. Stochastic optimization and local search
12-14 lectures + 6-8 laboratory sessions
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0
Learn problem solving:
‣ understand the problem
‣ design a solution algorithm
‣ implement the algorithm
‣ assess the program
‣ describe with appropriate language
Aims of the course
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0
‣ Individual project:
- “Design, implementation and experimental analysis of heuristics for a given problem”.
- Perfomance matters!
- Deliverables: written report + program
‣ Internal examiner
Final Assessment (5 ECTS)
DM
811
H
euri
stic
s fo
r Co
mbi
nato
rial
Opt
imiz
atio
n -
L0Course Material
‣ Text book
- Search methodologies: introductory tutorials in optimization and decision support techniques E.K. Burke, G. Kendall, 2005, Springer, New York
- Handbook of Approximation Algorithms and Metaheuristics. T.F. Gonzalez, Chapman & Hall/CRC Computer and Information Science) 2007.
- Stochastic Local Search: Foundations and Applications, H. Hoos and T. Stützle, 2005, Morgan Kaufmann
Marco Chiarandiniadjunkt, IMADAwww.imada.sdu.dk/~marco/
DM
812
M
etah
euri
stic
s -
L0Tabu Search
DM
812
M
etah
euri
stic
s -
L0Simulated Annealing
DM
812
M
etah
euri
stic
s -
L0Evolutionary Algorithms
0 1 1 0 1 1 1 0 Parent 1
cut
Parent 2
Offspring 1
Offspring 2
1 0 0 0 1 0 1 0
0 1 1 0 1 0 1 0
1 0 0 0 1 1 1 0
DM
812
M
etah
euri
stic
s -
L0Ant Colony
DM
812
M
etah
euri
stic
s -
L0Multiobjective Optimization
DM
812
M
etah
euri
stic
s -
L0Prerequisites
Final Assessment (5 ECTS)
The content of DM811 must be known
‣ Individual project:
- “Implementation and analysis of heuristics”
- deliverables: written report + program
‣ External examiner
DM
812
M
etah
euri
stic
s -
L0Contents of the course
1. Tabu Search2. Simulated Annealing3. Scatter Search and Path Relinking4. Experimental Analysis and Configuration Tools5. Machine Learning and the No Free Lunch Theorem6. Evolutionary Algorithms7. Ant Colony Optimization8. Estimation Distribution Algorithm and Cross Entropy9. Metaheuristics in Continuous Non-Convex Optimization10. Hybrid/Parallel Metaheuristics11. Multiobjective Optimization by Local Search12. Multiobjective Optimization by Evolutionary Algorithms
12-14 lectures + 6-8 laboratory sessions
DM
812
M
etah
euri
stic
s -
L0Course Material
‣ Text book
- Search methodologies: introductory tutorials in optimization and decision support techniques E.K. Burke, G. Kendall, 2005, Springer, New York
- Handbook of Approximation Algorithms and Metaheuristics. T.F. Gonzalez, Chapman & Hall/CRC Computer and Information Science) 2007