Bachelor Projects
The projects for 2019/2020 can be found at brightspace:
For regular students: https://brightspace.tudelft.nl/d2l/home/217439
For double bachelor students: https://brightspace.tudelft.nl/d2l/home/210877
For questions get in touch with Fernando Oliveira.
Below you can find previous projects.
2020
- Vera Martens, Reinforcement Learning for minimizing the total waiting time of passengers in a Taxi Dispatch Problem
- Mariette Schönfeld, Deep Neural Networks and Optimization: A promising tag team
2019
- Maarten van Wijngaarden, Taxis Dispatch: Minimizing waiting times by maximizing coverage
- Boet van de Wiel, Nurse Rostering: Determination of a target for weekly working hours given different skills
- Maaike Elgersma, Preventing overfitting in Mixed Integer Optimization based classification tree construction
- Louise Zwep, Optimisation Models for Merging Ambulance Regions in the Netherlands
- Marjolein Bouwmeester, Annualized hours: Comparing an exact optimization model with its approximation
- Esmay Verzijlbergen, Orienting phylogenetic networks
- Huijsman, Robbert, Tree-child Network Containment
- Thomas van der Pas, Comparing Performance of Locally Repairable Code
- Eva Slingerland, DNA Data Storage using Hamming and Reed-Solomon Codes: DNA Data Opslag met Hamming en Reed-Solomon Codes
- Joey van der Krogt, Comparing the Reed Solomon Code to Two Recently Found Codes for Distributed Storage
2018
- Sander Borst, Using the slice rank for finding upper bounds on the size of cap sets
- Lisa de Miranda, Ambulancelocaties bepalen met een benadering van het hypercube model
- Josephine Keim, Annualised hours: Optimisation with heuristic algorithm
- Bram van den Heuvel, Multi-robot parcel sorting systems: Allocation and path finding
- Arthur Mooiman, Computing Measures for Tree-Basedness of Phylogenetic Network
- Frankl Janisse, Measuring how far a nonbinary phylogenetic network is from being tree-based
- Erik ten Hagen, Comparing Sequential and Cooperative Erasure Repairing
- Ward Speé, Comparing Various Locality Approaches for Codes Repairing Two Erasures
2017
- Aizo Kroon, Nonlinear optimization of strategies: finding an optimal race strategy for the TU Delft Solar Boat
- Lennart Kerckhoffs, Models, Solutions and Relaxations of the Asymmetrical Capacitated Vehicle Routing Problem
- Angelica Babel, Levelling the number of required beds at the holding and recovery departments
- Ilja Jaspers, The Borsuk-Ulam Theorem in Combinatorics
- Nina Versluis, On The Cap Set Problem: upper bounds on maximal cardinalities of caps in dimensions seven to ten
- Irene Vooijs, Optimaliseren van de service van een taxisysteem met zelfrijdende voertuigen
- Niels Jonkman, Parental Parsimony on Phylogenetic Networks: Computing the Maximum Parsimony Scores of Phylogenetic Networks
- Noortje Bonenkamp, Resource-constrained Machine Scheduling
- Joep Bom, Cooperative Locality of Shortened Hamming Codes
- Sanne van Alebeek, Comparing bounds on binary error-correcting codes
2016
- Kitty de Smit, Minimaliseren van het aantal kruisingen in een multi-level graaf
- Céline Swennenhuis, Space-filling Curves Heuristics for the 4D Travelling Salesman Problem in Chip Manufacturing Machines
- Pascal de Koster, Strengthening the integrality gap for the capacitated facility location problem with LP-based rounding algorithms
- Daniël Vos, Basic principles of the traveling salesman problem and radiation hybrid mapping
- E.A de Swart, Resolving contradicting binets and finding similarities in networks
2015
- Dylan Huizing, Bezorgroutes Fresh Food
- Heleen Schutte, The Chipfiring Game
- Saskia Vertregt, Affine Caps
- Erica van der Sar, Constructing Evolutionary Supernetworks from Binets
- Lianne Bruijns, Optimale routes voor ambulances
- Gerald van der Geugten, Online Learning
- L. Jetten, Characterising tree-based phylogenetic networks
2014
- Eline Harderwijk, Vergelijking statische platsingsmodellen voor ambulances
- Chantal Posthoorn, Strategie voor Nuna Zuid-Afrika
- Steffie van Loenhout, Inplannen longfunctieonderzoeken
- Suzanne de Hoog, Indelen van Instrumentennetten
- Kishan Kalicharan, The little Grothendieck problem over the orthogonal group
- Pim Otte, Counting matchings in cubic graphs
2013
- Sander Gribling, Het ellipsoidealgoritme en een toepassing daarvan op de Lovasz-theta-functie
- Boris van Katwijk, Een selectie algoritmen voor lineair programmeren
- Pieter Kleer, Stabiele Koppleringen
- Eline Rietberg, The Shannon Capacity of Graphs
2012
2011
- Marijn Schreuders, Plurality Voting vs. Plurality Runoff Voting: De kans op tegenstrijdige uitslagen in grote verkiezingen
- Judith Mulder, Adapting the Chudak-Shmoys Approximation Algorithm to the k-level Uncapacitated Facility Location Problem
- Rutger Kerkkamp, Robuust optimaliseren toegepast op een electriciteitsnetwerk model
- Anneke Jacobs, Statistical Analysis of Newspaper Headlines with Optimization
2010
- Daphne Looije, Modelleren van de patientenstroom tussen de poliklinieken Orthopedie en Radiologie in het LUMC
- Frank Tabak, Counting Lattice Points in Polyhedra Using the Erhart Theory, applied to Voting Theory
- Jeroen Dekkers, Application of Bezier Curves in Computer-Aided Design
2009