The Road Network Design Problem for the Deployment of Automated Vehicles (RNDP-AVs): A Nonlinear Programming Mathematical Model

Once trusted, automated vehicles (AVs) will gradually appear in urban areas. Such a transition is an opportunity in transport planning to control undesired impacts and possibly mitigate congestion at a time when both conventional vehicles (CVs) and AVs coexist. This paper deals with the complex transport decision problem of designing part of the...

Optimize the indescribable: A Look at the Unification between Machine Learning and Optimization

Packages to encode Machine Learned models into optimization problems is an underdeveloped area, despite the advantages is could provide. The main draw of implementing Machine Learned models into optimization models, is that it allows the optimizer to better account for the human experience.<br/>Maragno D., Wiberg H. et al. constructed an...

Optimising First-Class Pattern Matching

Pattern matching is a high-level notation for programs to analyse the shape of data, and can be optimised to efficient low-level instructions. The Stratego language uses <i>first-class pattern matching</i>, a powerful form of pattern matching that traditional optimisation techniques do not apply to directly.<br/>In this paper, we investigate how...

LOSCO A Ship Lock Scheduling Model

A ship lock scheduling model called LOSCO was developed in order to decrease passage times at locks with two parallel chambers. Three locks were chosen to model, as they are some of the busiest locks of the Netherlands. The Krammersluizen, the Sluizen Hansweert and the Kreekraksluizen. Passage times are not collected at the locks, therefore the...

Route Optimisation For Mobility-On-Demand Systems With Ride-Sharing

Privately owned cars are an unsustainable mode of transportation, especially in cities. New Mobility on Demand (MoD) services should offer a convenient and sustainable alternative to privately owned cars. Notable in this field is the recent uprise of ride-sharing services such as offered by companies like Uber and Grab. Such services, especially...

Sequential convex relaxation for convex optimization with bilinear matrix equalities

We consider the use of the nuclear norm operator, and its tendency to produce low rank results, to provide a convex relaxation of Bilinear Matrix Inequalities (BMIs). The BMI is first written as a Linear Matrix Inequality (LMI) subject to a bi-affine equality constraint and subsequently rewritten into an LMI subject to a rank constraint on a...

Controller synthesis using interval methods

This thesis investigates whether interval methods can be employed in the construction of a novel controller synthesis algorithm based on backward induction. Interval methods are methods employing interval arithmetic, which is an arithmetic defined on real-valued intervals rather than on real-valued numbers. In the controller synthesis algorithm...