Pages
- 1
- 2
- document
-
Bakker, K.C. (author), Bouter, P.A. (author), Den Hoedt, M. (author)Het bedrijf NedTrain beschikt over software om roosterproblemen op te lossen. De wens van NedTrain en het doel van dit project is om deze software uit te breiden met de functionaliteit om flexibele schema's te berekenen. Deze roosterproblemen hebben te maken met het probleem dat ook wel bekend staat als het Resource Constrained Project...bachelor thesis 2014
- document
-
Bruurs, E.J.A.M. (author), Van de Louw, C. (author)Eindverslag bachelorproject. Het verslag staat in teken van de ontwikkelde applicatie in opdracht van Nedtrain. De opdracht betreft het maken van een grafische interface om een bestaand algoritme.bachelor thesis 2011
- document
-
Ammerlaan, E. (author), Elffers, J.A. (author), Walraven, E.M.P. (author), Wisse, W.C. (author)Dit verslag is het resultaat van het bachelorproject van onze studie Technische Informatica aan de Technische Universiteit Delft. Bij dit project is het de bedoeling om de aangeleerde concepten en ontwikkelmethoden toe te passen in een realistisch project. Hierbij dient het volledige proces van softwareontwikkeling te worden doorlopen. Tevens is...bachelor thesis 2012
- document
-
Pors, M.L. (author), Van der Valk, C. (author), Tetteroo, J. (author)Report about the 11 weeks period of the Bachelors Project done for the 'Twin Hub Network Project'. Goal of the Project was to create a application that shows different train/truck network using a 'Hub' in a graph form. This application uses a Twin Hub Bundling Algorithm written by Sebastiaan Meijer for his Masters Thesis.bachelor thesis 2013
- document
-
Mountakis, K.S. (author)We study the application of stochastic scheduling methods for dealing with the negative impact of uncertainty on the timely delivery of NedTrain maintenance projects. A stochastic scheduling problem includes a quantification of uncertainty by representing the duration of a maintenance activity with a probability distribution. The solution is no...master thesis 2013
- document
-
Wilmer, D. (author)Robustness is essential for schedules if they are being executed under uncertain conditions. In this thesis we research robustness in Partial Order Schedules, which represent sets of solutions for instances of the Resource-Constrained Project Scheduling Problem. They can be generated using a greedy procedure called Chaining, which can be easily...master thesis 2015
- document
-
Mînzatu, V. (author)Presents new algorithms for meeting the specific requirements of auto-completion in the context of geocoding systems.master thesis 2012
- document
-
Bouter, P.A. (author)The recently introduced Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) for discrete variables has been shown to be able to efficiently and effectively exploit the decomposability of optimization problems, especially in a grey-box setting, in which a solution can be efficiently updated after a modification of a subset of its variables....master thesis 2016
- document
-
Noroozian, A. (author)BitTorrent has turned into the most popular P2P file sharing protocol and is used for various purposes such as Video on demand and Media Streaming. The fundamental problem with P2P networks in general is that quality of service highly depends on altruistic resource sharing by participating peers. Many peers freeride on the good intentions of...master thesis 2010
- document
-
Schaafsma, B.J. (author)We present a new method to break symmetry in graph coloring problems, which can be applied in many classes of combinatorial problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we developed a learning scheme that translates each encountered conflict into one conflict clause which covers...master thesis 2009
- document
-
De Keijzer, B. (author)In many real-world decision making settings, situations arise in which the parties (or: players) involved must collectively make decisions while not every player is supposed to have an equal amount of influence in the outcome of such a decision. The "weighted voting game" is a model that is often used to make such decisions. The amount of...master thesis 2009
- document
-
Meijer, S.J.J. (author)Optimisation of transport networks can yield substantial reductions in transport costs and improve the quality of service for the users of these networks. When optimising intermodal rail-road networks, organising large transport volumes on transport links is key for bringing down the costs per container-kilometre. By bundling container flows in...master thesis 2012
- document
-
Oei, L.I. (author)Simple Temporal Problems (STPs) can be used for representation of and reasoning with temporal constraint satisfaction problems. In dynamic environments, it often happens that - after a problem has been modelled as an STP - a change occurs in one of the constraints. This can lead to an inconsistent situation, in which case there are negative...master thesis 2009
- document
-
Bun, A.A.L.M. (author)Transportation problems are common, but complex. Therefore, it is not surprising that much effort is put into finding solving methods which generate high quality solutions in little time. Some of those solving methods are developed as planning systems and tested at the Artificial Intelligence Planning Systems (AIPS) or International Planning...master thesis 2008
- document
-
Buitenhuis, M.S. (author)Congestion on the road is a widely recognized problem. To improve traffic conditions on the road, several methods have been developed over the years. Dynamic traffic management is one of them and has proven to be effective. It aims at making better use of the existing network capacity and at managing traffic flows. In order to further improve...master thesis 2015
- document
- Oosterloo, R.C. (author) master thesis 2017
- document
-
Evers, R.P. (author)In this thesis we will develop algorithms for the scheduling of train maintenance at NedTrain facilities. We present a detailed analysis of the maintenance process at NedTrain. The problem of scheduling train maintenance is formalized and expressed using linear inequalities. We show that the Simple Temporal Problem can be used to find schedules...master thesis 2011
- document
-
De Bokx, R. (author)The recently introduced Linkage Tree Genetic Algorithm (LTGA) has shown to exhibit excellent scalability on a variety of optimization problems. LTGA employs Linkage Trees (LTs) to identify and exploit linkage information between problem variables. In this work we present two parallel implementations of LTGA that enable us to leverage the...master thesis 2015
- document
-
Elffers, J.A. (author)We study the single machine version of the task scheduling problem with release times and deadlines. This problem is too simple to be of practical importance in itself, but it is also used as a relaxation in algorithms for the Job Shop scheduling problem, which is a more practical task scheduling problem. We study exact algorithms for solving...master thesis 2014
- document
-
Ridder, B.C. (author)In this document we will continue a line of research which focusses on reviving partial order planning. We will look at the latest pair of partial order planners, RePOP and VHPOP which both use techniques developed for state-space planners in an attempt to make partial order planning competitive with state of the art state-space planners. We...master thesis 2010
Pages
- 1
- 2