Abstract

Today, many small aerodromes have a hard time surviving economically, and amongst the largest cost is air traffic control. Airlines are cutting costs where they can, and many times this affects the aerodromes as well, e.g. when airlines decide to park remotely instead of at the gate. The project called Remotely Operated Towers, initiated by SESAR and run by Saab and LFV, is aiming to address this problem. The project revolves around remotely providing ATS to aerodromes where it is deemed suitable. A big challenge in this project is how to assign aerodromes to remote tower modules in the remote control centre. There are many ways to do this, but there is only a few ways to do it to achieve the least amount of modules. This thesis aims to find an optimal solution to the challenge mentioned above. The thesis resulted in a model where the user can provide the input of choice, i.e. aerodromes with associated ATS operating hours and movements, for a specific period – and receive the assignment schedule for the modules, saying exactly which aerodrome are to be controlled by which module at what time.

Abstract

The continuous network design problem (CNDP) is known to be difficult to solve due to the intrinsic properties of non-convexity and nonlinearity. Such kinds of CNDP can be formulated as a bi-level programme, in which the upper level represents the designer's decisions and the lower level the travellers' responses. Formulations of this kind can be classified as either Stackelberg approaches or Nash ones according to the relationship between the upper level and the lower level parts. This paper formulates the CNDP for road expansion based on Stackelberg game where leader and follower exist, and allows for variety of travellers' behaviour in choosing their routes. In order to solve the problem by the Stackelberg approach, we need a relation between link flows and design parameters. For this purpose, we use a logit route choice model, which provides this in an explicit closed-form function. This model is applied to two example road networks to test and briefly compare the results between the Stackelberg and Nash approaches to explore the differences between them.

Abstract

The typical voyage of a barge transporting maritime containers inland, consists of visiting a set of terminals where loading/unloading operations occur. The required stowage plans must meet stability requirements during all transport phases and avoid costly re-handling operations. In this paper, we formalize this problem and consider a typical dry-port transport system. We propose a comprehensive mathematical model that seeks to maximize stowed containers. To solve it, we develop a hybrid metaheuristic approach, based on local search and an industrial solver. Numerical experiments, based on real-world data, provide insights into the performances of the proposed framework and current stowage practices.