Searched for: contributor%3A%22de+Weerdt%2C+M.M.+%28mentor%29%22
(1 - 20 of 56)

Pages

document
Stoel, Fianne (author)
District heating systems (DHSs) have the potential to play a big part in the energy transition. The efficient operation of DHSs is therefore also an important subject of study. The operation of DHSs where combined heat and power (CHP) plants are used are particularly interesting, because CHPs can operate with high efficiency.<br/><br/>In this...
master thesis 2022
document
Hanou, Issa (author)
Shunting yards are the locations where trains, which are not included in the train schedule at a certain time, are parked until they are required again. Managing the parking of the trains such that all trains can leave at the desired time is a complicated task, and results in the problem formally known as the Train Unit Shunting Problem (TUSP)....
master thesis 2022
document
Jansen, Robin (author)
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduling problem for the operation of their production lines. This problem can be modeled as a flexible job shop problem (FJSP) in which a set of operations has to be assigned to a set of machines and then the order of operations on each machine has to...
bachelor thesis 2022
document
Numan, Tim (author)
This papers examines an ant colony optimization approach for solving a specific variant of the Flexible Job Shop Problem faced by the Dutch chemistry company DSM. Jobs consisting of operations on a specific enzyme need to be scheduled as efficiently as possible on groups of available machines. The most interesting requirement upon the general...
bachelor thesis 2022
document
van Eijmeren, Tiamo (author)
In this paper a heuristic algorithm is described that can constructively produce solutions to a variant of the Flexible Job Shop Problem (FJSP) that introduces changeover times between each pair of two operations consecutively performed on a machine. The performance of the heuristic algorithm is compared to the performance of an exact solver....
bachelor thesis 2022
document
Ivanov, Marko (author)
The aim of this research paper is to present two genetic algorithms targeted at solving the Flexible Job Shop Problem (FJSP). The first one only tackles a single objective - the schedule makespan, while the second one takes into account multiple objectives for the problem. Each schedule is represented by two integer vectors - one for the machine...
bachelor thesis 2022
document
Bak, Marco (author)
In this paper, a Simulated Annealing (SA) implementation for a Flexible Job Shop Problem (FJSP), with change-over time, is presented. <br/> This implementation is compared to a Mixed Integer Linear Programming (MILP) optimization, to compare performances. <br/> The SA algorithm starts with creating the first schedule with Global Selection. <br/>...
bachelor thesis 2022
document
Bos, Thomas (author)
Explainable artificial intelligence has in recent years allowed us to investigate how many machine learning methods are creating its predictions. This is especially useful in scenarios where the goal is not to predict a variable, but to explain what influences that variable. However, the methods that have been created thus far do not focus on...
master thesis 2022
document
Chong, Kevin (author)
Supply planning is an NP-Hard problem that is often tackled when dealing with supply chain management. It is a problem with many variations but the core idea is to create a plan that resolves as much demand as possible.<br/>There are different approaches in use to solve a planning problem, one of which is by using heuristics. Heuristics are used...
master thesis 2022
document
Papakyriakou, Thalis (author)
The DC Optimal Power Flow (DC-OPF) problem is a widely-studied topic in the field of power systems. A solution to the problem consists of minimizing the running costs of the power system, through defining the optimal operating state for each entity in the system, while adhering to a set of physical constraints. A lot of research has been...
master thesis 2021
document
Athmer, Casper (author)
The Train Unit Shunting and Servicing (TUSS) problem is an NP-hard problem encountered by the Dutch railway operator, Nederlandse Spoorwegen (NS). It considers trains at a shunting yard when they are not transporting passengers. It consists of four subproblems, involving assigning the trains at the yard to a transporting timetable (Matching),...
master thesis 2021
document
van der Woude, Thom (author)
Both the assignment problem and the multi-agent pathfinding problem are common problems in the fields of robotics and transportation. The joint problem of multi-agent pathfinding extended with the assignment of goals to agents, matching, is something that has not been studied much; few methods exist today that solve it. In this work, two types...
bachelor thesis 2021
document
de Bruin, Ivar (author)
This paper extends the Multi-Agent Pathfinding (MAPF) algorithm, A*+ID+OD, to be able to solve problems with matching. This extension still keeps the optimal and completeness properties of the original algorithm. Matching is added to the algorithm in both an exhaustive and heuristic manner. Exhaustive matching is further improved by adding a new...
bachelor thesis 2021
document
Dönszelmann, Jonathan (author)
Multi-agent pathfinding (MAPF) is the process of finding collision-free paths for multiple agents. MAPF can be extended by grouping agents into teams. In a team, agents need to be assigned (or matched) to one of the team's goals such that the sum of individual cost} is minimised. This extension is called MAPF with matching (MAPFM). M* is a...
bachelor thesis 2021
document
de Jong, Jaap (author)
For the Multi-Agent Pathfinding (MAPF) problem, a set of non-colliding paths must be found for multiple agents. In Multi-Agent Pathfinding with Matching (MAPFM), this problem is extended: agents and goals are added to a team and each agent has to navigate to a goal that belongs to the same team. In this paper, two extensions of the EPEA* MAPF...
bachelor thesis 2021
document
Baauw, Robbin (author)
In the Multi-Agent Pathfinding with Matching (MAPFM) problem, agents from a team are matched with and routed towards one of their team's goals without colliding with other agents. The sum of path costs of all agents is minimized. In prior works, Conflict Based Min-Cost-Flow (CBM) has been proposed. This algorithm solves a similar problem that...
bachelor thesis 2021
document
van der Knaap, Leon (author)
One of the planning problems encountered by the Dutch Railways (NS) at shunting yards is the train unit shunting problem (TUSP). This problem considers idle train units that have to be parked, be cleaned, undergo regular maintenance, and be reconfigured into the scheduled departing train compositions. A local search algorithm is being developed...
master thesis 2021
document
Hakim Zakuto, Aksel (author)
The current state-of-the-art solutions for playing Chess, are created using deep reinforcement learning. AlphaZero, the current world champion, uses ’policy networks’ and ’value network’ for selecting moves and evaluating positions respectively. However, the training of these networks are done using reinforcement learning from games of selfplay....
bachelor thesis 2021
document
van Cuilenborg, D.A. (author)
The Train Unit Shunting Problem (TUSP) is a well studied problem within the NS (Dutch Railways). TUSP is a problem where trains have to be routed on a shunting yard such that maintenance tasks can be performed and no collisions occur. Furthermore, incoming trains have to be matched to outgoing trains, since trains of the same type can be used...
master thesis 2020
document
Zomer, J. (author)
The current research addresses a problem found in the area of railway operations regarding the maintenance of rolling stock units. It focuses on the situation in The Netherlands and approaches the problem from the perspective of its main railway operator N.V. Nederlandse Spoorwegen (NS).<br/>The increasing use of the capacity of the railway...
master thesis 2020
Searched for: contributor%3A%22de+Weerdt%2C+M.M.+%28mentor%29%22
(1 - 20 of 56)

Pages