DM841 (E21) - Heuristics and Constraint Programming for Discrete Optimization

Obligatory Assignment 3

Preamble

  • This is the first of two assignments on discrete optimization that will be used to determine your final grade. The assignment will be graded with external censorship. The final grade for the course will be an overall assessment of the two assignments starting from the arithmetic average.

  • This assignment consists of two cases and you have to choose one.

  • The assignment has to be carried out individually. Communication for feedback and inspiration with peers is allowed but it should be kept to a minimum. In case, you are welcome to ask to the teacher.

  • The submission is electronic via git.imada.sdu.dk.

  • Deadline: November 16, 2021, at 12:00

  • You have to submit:

    • a PDF document containing max 10 pages of description of the model and the results you have obtained on the data sets available

    • source code of your implementation of the model in MiniZinc.

    The precise format for the submission is the same as for the first assignment. You find the details at the end of this page.

Cases:

A. Vehicle Routing

B. Exam Timetabling

Submission details

The submission system is the same via git that was used in Assignment

  1. Please refer to that description for the details. Use the following structure and names for your repository, where prob1 and prob5 are the problems solved (yours might be different):
Repo_march
|-	asg3
|	├── data
|	│   ├── dir1
|	│   └── dir2
|	├── src
|	└── tex
└────── README.md