TU Delft Algorithmics
Algorithmics
Delft University of Technology Doing your Master's ALG Group
EWI ALGDoing your Master's
eng
 
 
 
 
 
 
 
 
 
Doing your Master's within the Algorithmics group
If you do your Master's within the Algorithmics group, you will probably join the research project of one of the members. One of them will be your daily supervisor, and Cees Witteveen will be your professor, and the president of your graduation committee. You will also be invited to join the monthly Master's meetings. See here for current and previous Master's students, and read the instructions for doing your Masters and writing your thesis. See also:
Important: EWI's manual for the MSc Thesis project
Also important: various other relevant information, for example concerning 'afstuderen,' 'examendata,' 'formulieren,' 'reglementen.'
The thesis LaTeX style
Instructions for using the thesis LaTeX style (from Software Engineering)
After your literature survey, your first assignment will be to write a Master Thesis Proposal. Guidelines for writing such a proposal are given at this page from the software engineering group. Please read this text carefully.
Practical instructions for Master's students
When you start doing your Master's project within Algorithmics, first arrange the following.
Add all the activities of the Algorithmics group to your agenda. We expect you to be there!
Put yourself on the alg_masters mailing list to get updated on new activities.
Arrange a login on the departments workstations (8th or 9th floor) by filling in the form at the help desk (HB 09.150) of the department of Software Technology.
Be sure to attend the Monthly Master's Meetings (see below for dates).
See the people page for your colleagues, and send your supervisor a mail with a request to be added there.
Come every day to work at the workstations at the 8th floor, together with the other Master's students.
Join us for lunch every day at 12:00.
When you start doing a literature study, be sure to check out these writing tips.
Yingqian Zhang's presentation on Research skills is very useful to get an idea of what doing research is.
Make notes during the meetings with your supervisor.
When you have finished your literature report, and when you have finished your Master's thesis, it is a good idea to make it available to the world. Therefore, add them to the publication website.
Check out these links:
Smartstudie
Time management
Howto's
A (Not So) Short Introduction to LaTeX2e, "while it is not as comprehensive as Lamport's book, it should be sufficient in most cases."
Online tutorials on LaTeX, by the Indian TeX Users Group, including sources, these are *very* useful, and subdivided by topic.
The TeX showcase, many examples of what you can do with (La)TeX, in most cases including the source—excellent for learning.
Demo scripts for gnuplot version 4.2 (that's the version installed here), shows virtually everything you could possibly do with gnuplot.
This incredible site shows even more you can do with gnuplot.
The LaTeX Beamer Class Homepage, for superior presentations.
Beamer Guide, using beamer, also in combination with pstricks.
Prosper homepage, another LaTeX package for making presentations, not as good as beamer, but there's a style for making presentations in the TU Delft house style available for prosper (not for beamer—I've asked, but to no avail yet).
The R Project for Statistical Computing, a free software environment for statistical computing and graphics, you can use this to run the scripts Rik Lopuhaä prepared for the talk he gave on April 2, 2008.
Monthly Master's Meeting
The Monthly Master's Meeting is primarily meant to get to know all (other) Master's students within the Algorithmics group. Usually we first have a a talk and/or discussion, and then a brief update on everyone's progress. After that, we have a drink together in the /Pub.
The goals of this meeting are to stimulate cooperation, and exchange of experiences among master's students. This can vary from exchanging LaTeX tips to doing part of your thesis work together. The invitation for this meeting will be sent through the alg_masters mailing list, so make sure you are subscribed to this list.
Info
Date
Location
Get to know each other Wednesday September 13th 2006 Delft, EWI, 09.120
Current progress Wednesday October 18th 2006 Delft, EWI, 09.130
Lian Ien Oei on her literature study; motivational problems Wednesday November 15th 2006, 16:00 - ?? Delft, EWI, 09.130
Joost Cassee on his literature study; current progress Wednesday December 20th 2006, 16:00 - ?? Delft, EWI, 09.130
Leon Planken on his literature study; progress Friday February 16th 2007, 16:00 - ?? Delft, EWI, 09.130
Dimos Mpekas on "Model-based diagnosis: A decentralized approach for monitoring and diagnosing train systems"; progress Friday March 16 2007, 16:00 - ?? Delft, EWI, 09.130
Yingqian Zhang about "How to do research"; Joost's problem Wednesday April 11 2007, 16:00 - ?? Delft, EWI, 09.130
Jeroen van den Enden on "Adaptive referral networks" Wednesday May 9 2007, 16:00 - ?? Delft, EWI, 09.130
Mathijs de Weerdt about his experience visiting a scientific conference, the AAMAS Wednesday June 13 2007, 16:00 - ?? Delft, EWI, 09.130
Anne-Aimee Bun on The Logistics Planning Problem vs. the Vehicle Routing Problem Wednesday September 19 2007, 16:00 - ?? Delft, EWI, 09.130
Stephan van Keulen on Optimizing a look ahead SAT-solver Wednesday October 17 2007, 16:00 - ?? Delft, EWI, 09.130
Sicco Verwer on "Learning Timed Automata" and a discussion on how to present your research Wednesday November 14 2007, 16:00 - ?? Delft, EWI, 09.130
Studieadviseur Jolien Kooijman over obstakels bij het afstuderen (in Dutch) Wednesday December 19 2007, 16:00 - ?? Delft, EWI, 09.130
Leon Planken on "New Algorithms for the Simple Temporal Problem Wednesday January 23 2008, 16:00 - ?? Delft, EWI, 09.130
dr. André Bos, former Algorithmics student, aio and postdoc Friday February 22 2008, 16:00 - ?? Delft, EWI, 09.130
dr. Rik Lopuhaa will teach us which statistical methods to use to analyze your experimental results (scripts and slides) Wednesday April 2 2008, 15:45 - 17:30 Delft, EWI, 09.130
Behnam Jalilzadeh on Employing Mechanism Design for an Online Auction with Non-identical Expiring Items Wednesday April 23 2008, 16:00 - ?? Delft, EWI, 09.130
your progress and thoughts about the MMM's Wednesday May 21 2008, 16:00 - ?? Delft, EWI, 09.130
Arvind Ganga on Distributed Algorithmic Mechanism Design in P2P File-Sharing Systems Wednesday June 18 2008, 16:00 - ?? Delft, EWI, 09.130
Wednesday July 9 2008, 16:00 - ?? Delft, EWI, 09.130
Gerrit Jan van Ahee on Repeated Mechanism Design Wednesday September 3 2008, 16:00 - ?? Delft, EWI, 09.130
Bas Schaafsma on Symmetry breaking conflict clauses for k-colour graph instances Wednesday October 1 2008, 16:00 - ?? Delft, EWI, 09.130
Jeroen van Belle on Context-Aware Multi-Stage Routing Wednesday November 5 2008, 16:00 - ?? Delft, EWI, 09.130
Bart de Keijzer on the Computation of Power Indices Wednesday January 7 2009, 16:00 - ?? Delft, EWI, 09.130
Henk Pijper Wednesday February 3 2009, 16:00 - ?? Delft, EWI, 09.130
-- Delft, EWI, 09.130
Wednesday October 7 2009, 16:00 - ?? Delft, EWI, 09.130
Wednesday November 4 2009, 16:00 - ?? Delft, EWI, 09.130
Wednesday December 2 2009, 16:00 - ?? Delft, EWI, 09.130
Legend:
past MMMs
definite MMMs
tentative MMMs
Available Master's projects
Beschikbare afstudeeropdrachten
There are a couple of different topics to do your Master's on within the Algorithmics group. Usually you will discuss potential topics with your supervisor and then write a project proposal yourself. The following topics are general descriptions to give an idea of the topics available for potential project proposals. As a member of the Algorithmics group, Master's students are encouraged to join the many activities.

Prediction of material malfunctions in trains

Modern trains are equipped with a lot of ICT supplies. This makes it possible to obtain sensor data, which can be used for data-mining. In this masters project the goal is to find, within this sensor data, indicators for (soon to be) malfunctioning material. These indicators can then be used to give advice regarding which parts of the train should be inspected and/or repaired.

This thesis consists of two parts:

  • Construct, using patterns in the sensor data and repair history, a decision model which shows what parts of the train should be inspected.
  • Refine the constructed model in order to use it for prediction of how long it will take before a part will malfunction.

Quality personal transport for elderly and disabled people

Currently the quality of personal transport for elderly and disabled people is very low. The main reason is the heavy competition for the three-year long contracts with governmental institutions. What if people can choose their preferred company per ride? What if people can choose between different pick-up times for their transport?

In this project you will test multiple methods for assigning transportation jobs to taxi companies, such that the preferences and quality for the end-users increases without increasing the costs for the government too much.


City logistics

Cities do not like trucks in their city center, but still their stores need supplies. Many cities therefore have strict rules for when trucks are allowed in the city center. These rules are different for every city, but still often such that one truck of a chain of stores cannot visit multiple cities at the same day. Can we help the national government to set-up a game such that cities and trucking companies are encouraged to coordinate their schedules?

For this project you will study the interesting field of mechanism design. To get to know more about the application, we will bring you into contact with researchers from the Erasmus university who are studying many other aspects of city logistics as well.


Planning in the harbor

In the harbor in Rotterdam, every day many barges need to visit a number of the terminals. Sometimes they need to wait a long time before they are served. What can we do to coordinate the loading and unloading of barges at the different terminals better to reduce the total time barges spend waiting for their turn?

For this project you will study the interesting field of mechanism design. To get to know more about the application, we will bring you into contact with researchers from the Erasmus university who are studying many other aspects of the process in the harbor as well.


Barge/lock scheduling

When barges sail from Roterdam harbor to Germany they need to pass a number of locks. Such locks open about every half an hour, so if a ship just missed an opening, it has a delay. Also a lock has a limited capacity, so if someone arrives at the lock just ahead of you, you also have to wait. Because of this, many barges sail at maximum speed to try to catch the current opening. Often they fail anyway, because they do not know the current situation at the lock.

In this project you will test multiple methods for assigning slots in an opening to barges in advance. This assignment should be fair, and it should reduce the urge of shippers to sail at the (costly) maximum speed, while maintaining (or even improving) the average throughput of ships over our rivers.


Preferences in temporal planning

At airports many processes such as the arrival and departure of planes and the use of gates need to be coordinated in time. Several parties have different preferences concerning the resulting schedules.

In this project you will develop a (search) algorithm to solve the temporal planning problem with preferences. Some of the techniques from the Satisfiability master course can be used to develop this temporal solver. Currently already one Master student is working on this project to give you a good head start.


(Cooperative) multiagent planning competition

Many existing competitions or problem settings include a multiagent planning component: in Robo Rescue robots need to coordinate their plans to get people safely out of hazardous environments. In the Trading Agent Competition and especially the supply chain management game, the activities of different organizations involved in getting products to the customers need to be coordinated. Finally, in the DARPA Coordinators program, the problem setting is to provide automated decision support for military field units. For each of these settings different algorithms are used. This project is an investigation of these settings and about a comparison, and possibly improvement of the existing approaches.

Part of the research assignment could be to set-up a competition for such cooperative multiagent planning problems and/or participate in one the competitions mentioned above.


Other topics related to multi-agent systems

Within the Algorithmics group we also study some other topics that do not directly deal with multi-agent systems and transportation. In consultation with the mentioned supervisor, you can also work on one of the following topics:

  • continue on the paper you wrote for the CABS seminar
  • game-theoretical multiagent planning
  • dealing with resource conflicts
  • task allocation
  • dealing with incidents
  • satisfiability

These projects all have a practical side, but can also be extended with a theoretical counter part. The project will be adapted to your own interests and abilities.


More information

If you are currently not studying in Delft, but if you'd like to study here, please read and act according to the formal guidelines found on the webpage of the Delft University.

                                                                                                                                                                                                                                                                             
Top of the page