Warning! The directory is not yet complete and will be amended until the beginning of the term.
040491 VK nBWM PM/LM: Implementation of Optimization Methods (2016S)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from We 17.02.2016 09:00 to We 24.02.2016 12:00
- Deregistration possible until Mo 14.03.2016 23:59
Details
max. 20 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Friday 04.03. 13:15 - 14:50 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 04.03. 15:00 - 20:00 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 09.03. 11:30 - 13:05 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 09.03. 13:15 - 14:45 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 09.03. 15:00 - 16:45 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 09.03. 16:50 - 18:30 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 09.03. 18:35 - 19:00 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 16.03. 13:15 - 14:45 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 16.03. 15:00 - 18:15 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Wednesday 16.03. 18:30 - 19:00 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 18.03. 13:15 - 20:00 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 15.04. 13:15 - 20:00 PC-Seminarraum 1 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 29.04. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 13.05. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 20.05. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 03.06. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 10.06. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 17.06. 13:15 - 20:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
- Friday 24.06. 13:15 - 15:00 PC-Seminarraum 5 Oskar-Morgenstern-Platz 1 1.Untergeschoß
Information
Aims, contents and method of the course
Assessment and permitted materials
The assessment is based on following components:
[10%] Theory questions presented in class
[15%] In class programming exercises
[25%] Homework exercises
[50%] Programming exams
[10%] Theory questions presented in class
[15%] In class programming exercises
[25%] Homework exercises
[50%] Programming exams
Minimum requirements and assessment criteria
The assessment is based on the weighted sum of points collected for theory questions, programming exercises, homework exercises and exams. The following grade scale will be used:
< 50% => 5
50-62,5% => 4
62,6-75% => 3
75,1-87,5% => 2
87,6%-100% => 1
< 50% => 5
50-62,5% => 4
62,6-75% => 3
75,1-87,5% => 2
87,6%-100% => 1
Examination topics
Know how to use Microsoft Visual Studio 2015 to implement C++ console programs
* Understand and know how to use C++ language constructs with focus on the procedural programming paradigm and limited to concepts and constructs that are relevant for implementation of optimization algorithms
* Know how to use tools and methods to express algorithms in C++
* Know how to implement Constructive Heurisic Algorithms for the travelling salesman problem
* Know how to implement Improvement Algorithms for tour optimization
* Know how to implement (Meta-)heuristics algorithms for the Vehicle Routing Problem
* Understand and know how to use C++ language constructs with focus on the procedural programming paradigm and limited to concepts and constructs that are relevant for implementation of optimization algorithms
* Know how to use tools and methods to express algorithms in C++
* Know how to implement Constructive Heurisic Algorithms for the travelling salesman problem
* Know how to implement Improvement Algorithms for tour optimization
* Know how to implement (Meta-)heuristics algorithms for the Vehicle Routing Problem
Reading list
All teaching material (slides, exercises, sample solutions, etc.) are available on the elearning platform Moodle. In order to access this material you need a valid UNET account. Moodle weblogin:https://moodle.univie.ac.at/Useful links:
http://www.uow.edu.au/~nabg/ABC/ABC.html
http://www.cplusplus.com/doc/tutorial/
http://www.cppreference.com
http://www.uow.edu.au/~nabg/ABC/ABC.html
http://www.cplusplus.com/doc/tutorial/
http://www.cppreference.com
Association in the course directory
Last modified: Mo 07.09.2020 15:29
* Introductory module to TL/PM/SCM is recommended
* Personal Computer (Windows 7 or higher, processor with 1,6GHz, 1 GB RAM, 4 GB on Disk), better is recommended
* Visual Studio Community 2015 (free)As an alternative, you can use any other C++ Programming Tool (without support in the course)The course covers following topics:
* Get familiar with Microsoft Visual Studio 2015 (create projects, writing and running programs, debugging, etc. )
* Basic concepts of the C++ programming language (data types and operators, selective structures, iteration structures, input and output with files, arrays, functions, structures, pointers, standard template library, recursive functions). The course does not cover object oriented programming concepts.
* Methodological knowledge for developing algorithms and their translation into C++ (a step by step approach to select suitable data and program structures)
* Flow charts as a measure to describe algorithms properly
* Implementation of Constructive Methods (Nearest Neighbour and Insertion Procedure) and an Improvement Method (2-opt) for the Traveling Salesperson Problem (TSP)
* Implementation of the Savings Algorithm and the Pilot Method for the Vehicle Routing Problem (VRP)Structure of most lectures is as follows:
* Reading and research assignments covering C++ topics and optimization problems that are required in order to prepare answers for theory questions by every student.
* Presentation and discussion of optimization problems and solution procedures by a student (as part of theory questions)
* Alternating blocks of (1) presentations about C++ language constructs by the lecturer and (2) programming exercises about these constructions performed in teams of two students.
* Homework programming exercised based on the exercises performed in groups of up to three students.