Scheduling an international relay-run

Bachelor Thesis (2019)
Author(s)

M.C. van Meerten (TU Delft - Electrical Engineering, Mathematics and Computer Science)

L. Overdevest (TU Delft - Electrical Engineering, Mathematics and Computer Science)

J. Nieuwdorp (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

Matthijs T. J. Spaan – Coach (TU Delft - Algorithmics)

H Wang – Graduation committee member (TU Delft - Multimedia Computing)

O.W. Visser – Graduation committee member (TU Delft - Data-Intensive Systems)

Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright
© 2019 Martijn van Meerten, Lennart Overdevest, Jasper Nieuwdorp
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 Martijn van Meerten, Lennart Overdevest, Jasper Nieuwdorp
Graduation Date
01-02-2019
Awarding Institution
Delft University of Technology
Programme
['Computer Science and Engineering']
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Roparun is a Foundation that organizes a yearly relay race from Paris, Hamburg and Almelo to Rotterdam in order to raise money for a variety of causes related to palliative care. They requested for an application that could create the start schedule of the race. In this thesis, the problem is analyzed and a greedy based solution is presented. Furthermore, the process to create the application, and the application's architecture is described.

Files

BEP_Roparun.pdf
(pdf | 6.05 Mb)
License info not available