- 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
-
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
-
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
-
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
-
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
-
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
-
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, Jordi (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
- document
-
Stelmach, Fabian (author)This research is focused on the proactive-reactive rescheduling process of the Train Unit Shunting Problem (TUSP) on train maintenance shunting yards. An important difference between a scheduling process and the rescheduling process is that a reschedule must be both feasible and desirable (similar to pre-schedule), while a schedule does not...master thesis 2020
- document
-
Maas, O.P. (author)Social housing corporations in the Netherlands have a limited ability to influence the social housing market through offering houses to households outside of the regular waiting-list system, but often do not use an algorithmic strategy for utilising this freedom well. There is thus an open question of whether there exist algorithmic approaches...master thesis 2020
- document
-
van Doesburg, Karel (author)One of the main challenges of today is the energy transition from fossil fuels to green renewable energy. One new concept that can aid this transition is the smart charging of electric vehicles. Smart charging is utilizing the flexible availability of an electric vehicle to charge on a time when this is most valuable, while complying to the...master thesis 2020
- document
-
Jadoenathmisier, Noah (author)Multi-Agent Path Finding with Way-points (MAPFW) is the problem of routing agents through a graph past a set of waypoint to a goal location, without agents colliding, with the shortest combined path length. This problem has to the authors knowledge not been investigated yet even though it has implications in train scheduling problems and video...bachelor thesis 2020
- document
-
Siekman, Stef (author)In the field of cooperative multi-agent pathfinding (MAPF) the optimal set of non-conflicting paths must be found for a set of agents in a graph. The addition of waypoints to this problem (MAPFW) gives rise to the possibility of more complex applications, such as in vehicle routing, aviation, computer games or robotics. Yet no algorithms have...bachelor thesis 2020
- document
-
Michels, Andor (author)In the multi-agent pathfinding (MAPF) problem, agents have to traverse a graph to a goal location without running into each other. Currently, the Branch-and-Cut-and-Price-MAPF (BCP-MAPF) algorithm is the state-of-the-art algorithm for solving MAPF problems, which uses Branch-Price-and-Cut (BPC) to solve a linear minimization problem. The multi...bachelor thesis 2020
- document
-
van Dijk, Jeroen (author)Little to no research has been done on the multi-agent path finding with waypoints problem (MAPFW) even though it has many important real world applications. In this paper we extend an existing algorithm for the multi-agent path finding problem (MAPF) called M* \cite{New}. We do so by ordering the waypoints using a Travelling salesman problem...bachelor thesis 2020
- document
-
Ferwerda, Arjen (author)Multi-Agent Pathfinding (MAPF) is a problem in which the goal is to plan paths for distinct agents while avoiding collisions between agents. We consider a new variation of MAPF, namely MAPF with multiple waypoints (MAPFW), where agents are required to visit a set of intermediary locations before visiting their end goal. MAPFW may have...bachelor thesis 2020
- document
-
van den Bogaerdt, Pim (author)We investigate the use of relaxed decision diagrams for obtaining lower bounds on multi-machine scheduling problems. The type of scheduling problem we consider models a railway service site where maintenance jobs are performed, but is sufficiently general to potentially have wider applicability.<br/>We find that our decision diagram formulation...master thesis 2018