Optimization with Metaheuristics
General information:
This course contains in the first part an introduction to the programming language Python. In the second part we will discuss certain heuristic solution methods for difficult planning problems. In particular we will deal with the main logistics planning problem, the vehicle routing problem (VRP). For solving that problem we will use so called local search based metaheuristics, a very general framework for tackling various difficult planning problems. The goal is to implement those metaheuristics in Python, and to solve standard VRPs. As a prerequisite you should have already attended either the course “Production and Operations Management” or “Supply Chain Management and Logistics”. It is also sufficient if you have attended such courses already in your bachelor program. Knowledge of any programming language is helpful but not mandatory.
Dates:
| Lecture / Tutorial | Date | Room |
| Introduction to Python (Prof. Almeder) | 13.10. (9:00 - 18:00) 20.10. (9:00 - 13:00) |
HG 217 |
| Tutorial: Programming with Python (Hein) | 20.10. (14:00 - 18:00) 27.10. (9.00 - 18:00) |
HG 217 |
| Introduction to Metaheuristics (Prof. Almeder) | 03.11. (9:00 - 13:00) 10.11. (9:00 - 13:00) |
HG 217 |
| Tutorial: Metaheuristics with Python (Hein) | 03.11. (14:00 - 18:00) 10.11. (14:00 - 18:00) |
HG 217 |
| Presentation of Assignment | 24.11. (9:00 - 18:00) | HG 217 |
| Final Exam | 28.11.- 02.12. |
Registration:
- The number of participants is limited to 20 students.
- Please enrol yourself in Moodle until October 10, 2016 (Password: META1617) and upload a recent overview of your grades
Grading:
- 2 small assignments (10%)
- 1 assignment incl. presentation (20%)
- Final exam (70%)
Organization:
- You need to bring your own laptop.
- Download and install
- Python 3.5
- JetBrains PyCharm (Python IDE)
Moodle:
- All materials will be uploaded in Moodle