Creating New Train Timetables in Case of Disruptions: Optimising a Branch & Bound Algorithm

The Dutch railway system is one of the most densely used systems worldwide and the busiest in Europe. Given the tight schedules, incidents can quickly cascade through the entire country if not handled properly. Alternative timetables are created to help train traffic controllers swiftly resolve such incidents. These schedules are currently...

Estimating the duration of the Branch and Bound algorithm for 0-1 Knapsack problems

The Branch and Bound method is a very useful method for nding solutions to optimization problems. However it does come with some problems as the search tree used for the Branch and Bound algorithm can be very large in size and can result in very long processing times as well as a large memory use. There is currently no known way to exactly know...

Intermodal Transport: Routing Vehicles and Scheduling Containers

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can be optimized. This problem can be modelled as an integral multi-commodity min cost flow problem on a time-space graph. This model has an arc-based and path-based form. In this thesis, the...

A Hybrid Optimal Control Approach to Multi-Aircraft Formation Flying

A Hybrid Optimal Control (HOC) framework which can be used in conjunction with existing optimal control software is presented. By using hybrid optimal control theory, trajectory optimization problems for systems that are both discrete time and continuous time from a mathematical perspective can be solved. A case study on multi-aircraft formation...