print print


Practical Optimization Algorithm Design [实用算法设计]

This lecture takes place at the School of Software Engineering [中国科学技术大学软件学院] of the University of Science and Technology of China (USTC) [中国科学技术大学] in Héféi [合肥], Ānhuī [安徽], China [中国] in the winter semester of 2011/2012 in English language.

Title:Practical Optimization Algorithm Design [实用算法设计]
Location:软件学院楼201教室, 
Time:Monday [星期一], 07:50-09:25 (week 7 to 8)
Thursday [星期四], 09:45-12:10 (week 2 to 20)
Lecturer:Thomas Weise [汤卫思, Tāng Wèisī], tweise@gmx.de
Lab Class:On Friday in the Computer Pool Room 404
Dates: Oct 14, Oct 21, Nov 11, Nov 18, Dec 2, Dec 9, Dec 23, Dec 30
Time: 18:30-21:30
Exam:Friday, 2012-01-13, 08:30-11:30, Room 201
Project:Capacitated VRP. Deadline: 2011-12-31

Material

  • Teaching Material (New Book): pdf (19 MiB, version: 2011-12-07) @ustc
  • Framework Sources: sources.zip @ustc (224 kiB, 2011-12-08) [updated: +1st homework]
  • Project Sources: project.zip @ustc (72 kiB, 2011-12-02)
  
  1. Thursday 2011-11-24 (13周); Lesson 3-5: 09:45-12:10
  2. Wednesday 2011-11-30 (14周) 23:59: Deadline for Homework 6
  3. Thursday 2011-12-01 (14周); Lesson 3-5: 09:45-12:10
  4. Friday 2011-12-02 (14周); 18:30-21:30; Lab Class
  5. Wednesday 2011-12-07 (15周) 23:59: Deadline for Homework 7
  6. Thursday 2011-12-08 (15周); Lesson 3-5: 09:45-12:10
  7. Friday 2011-12-09 (15周); 18:30-21:30; Lab Class
  8. Thursday 2011-12-15 (16周); Lesson 3-5: 09:45-12:10
  9. Wednesday 2011-12-21 (16周) 23:59: Deadline for Homework 8
  10. Thursday 2011-12-22 (17周); Lesson 3-5: 09:45-12:10
  11. Friday 2011-12-23 (17周); 18:30-21:30; Lab Class
  12. Wednesday 2011-12-28 (17周) 23:59: Deadline for Homework 9
  13. Thursday 2011-12-29 (18周); Lesson 3-5: 09:45-12:10
  14. Friday 2011-12-30 (18周); 18:30-21:30; Lab Class
  15. Friday 2011-12-31 (18周); 23:00: Deadline Project Work
  16. Thursday 2012-01-05 (19周); Lesson 3-5: 09:45-12:10
  17. Thursday 2012-01-12 (20周); Lesson 3-5: 09:45-12:10

Lessons

0.Organization
1.Introduction
2.The Structure of Optimization
3.Hill Climbing and Random Walks
4.Simulated Annealing
5.Comparing Optimization Algorithms
6.Genetic Algorithms
7.Difficulties in Optimization
8.Evolution Strategies
9.Differential Evolution
10.Genetic Programming
11.Multi-Objective and Constraint Optimization
12.Estimation of Distribution Algorithms
13.Swarm Intelligence: PSO and ACO
14.Random Keys Encoding
A.Exam

Exercises and Homework

  • Homework will be given approximately every week.
  • The homework will make up 25% of the final score in the course.
  • The homework e sent to me via the email address: tweise@ustc.edu.cn
  • The subject of the email e "[xx] Student ID" where "xx" is to be replaced with the two-digit exercise number and "Student ID" with the sender's student ID.
  • Homework handed in after the deadline will be ignored and can score no points.
  • Acceptable attachments for emails are: .pdf, .txt, .doc, .jpg, .java, .c, .cpp and makefiles as well as .zip archives containing files of these types.
  • Emails containing attachments of types which are not listed, especially executable binaries, may not be processed or even be deleted.
  • Java sources e compilable with Eclipse and C or C++ files e compilable with MinGW and may be accompanied by a makefile.
  • Questions regarding the homework can be sent to me via email or — in urgent cases — via QQ.
  • Only solutions written in English will be accepted.
1.Homework 01: Hill Climbing
2.Homework 02: Simulated Annealing
3.Homework 03: Statistical Evaluation
4.Homework 04: Genetic Algorithm
5.Homework 05: Difficulties in Optimization
6.Homework 06: Evolution Strategies
7.Homework 07: Differential Evolution and Genetic Programming
8.Homework 08: Genetic Programming and MOEAs
9.Homework 09: MOEAs

9.Answers to Theory Questions

Magic Square Challenge

Project: Capacitated Vehicle Routing with a Heterogeneous Fleet