This thesis is a simulation study aimed to improve the common-use check-in process at SAS Ground Handling operating at Arlanda Airport. The study sought to determine how to design the common-use check-in to minimize waiting times, reduce resource use, and increase the share of passengers checked in within service level targets. The simulation study was performed using Arena Simulation Software, testing different check-in setups which experimented with which flights were included in the common-use check-in solution, how many flows there would be for each booking class, and which flights would be allocated to each flow. The study found that changing how economy passenger flows are organized and how flights are divided between check-in flows could improve efficiency. The study concludes that the existing common-use check-in solution should continue to handle current assigned flights and recommends dividing the economy passenger flow into two separate flows based on passenger service times. / <p>Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet</p>

Les terminaux à conteneurs utilisent les nouvelles technologies (EDI, RFID et GPS) pour échanger des données avec leurs partenaires, pour localiser les conteneurs et leurs équipements dans le terminal, et pour automatiser des tâches. Dans cette thèse, nous montrons comment ces informations peuvent être utilisées dans la gestion des opérations.La première partie utilise les informations sur les volumes annoncés pour affecter des ressources internes dans le but de minimiser le retard global au terminal. Nous représentons cette problématique à l'aide d'un problème de flot que nous implémentons comme programme linéaire mixte. Une étude de cas est réalisée pour un terminal du Grand Port Maritime de Marseille. En outre, nous combinons le problème d'affectation de ressources avec le dimensionnement d'un système de rendez-vous. Ceci permet de minimiser le retard global.La deuxième partie utilise les informations sur les conteneurs à retirer et leurs emplacements pour optimiser le déstockage. Le but est de retirer tous les conteneurs d'une rangée en minimisant le nombre de repositionnements parasites. Nous améliorons un modèle binaire, proposons une approche exacte de type branch and price - avec un sous-problème binaire et deux variantes d'un sous-problème énumératif - et en dérivons une approche heuristique - avec un sous-problème heuristique. L'approche exacte ne résout que les petites instances ; l'approche heuristique obtient des résultats satisfaisants mais devra être améliorée. Nous nous intéressons aussi à la version dynamique du problème où les informations sur les conteneurs à retirer arrivent petit à petit et comparons différentes stratégies de repositionnement. / Container terminals use intelligent freight technologies (e.g., EDI, RFID and GPS) to exchange data with their partners, to locate containers and equipment within the terminal, and to automate tasks. This thesis illustrated, via two examples, how this data may be used to optimize operations at the terminal.The first part uses information on announced volumes to allocate internal handling equipment. The objective is to minimize overall delays at the terminal. The problem is represented as a network flow problem and implemented as a linear mixed integer programming model. A case study for a terminal at the Grand Port Maritime de Marseille is carried out. We also showed that combining the allocation problem with the dimensioning of a truck appointment system may reduce overall delays at the terminal. The second part uses information on announced container retrievals and container positions to improve retrieval operations. The objective is to retrieve containers from a bay in a given sequence with a minimum number of parasite relocations. We improve an existing binary programming model and introduce an exact branch and price approach - with a binary subproblem and two variants of an enumerative subproblem - and a heuristic branch and price approach - with a heuristic subproblem. The exact approach solves only small instances; the heuristic approach performs well on several instances, but should be improved further. We also deal with a dynamic version of the problem where the retrieval order becomes revealed over time and evaluate different relocation strategies for this case.

The goal of the thesis is to develop tools for improving shipbuilding workshops productivity. These tools have been tested on workshops of Aker Yards France shipyard, in Saint-Nazaire. The main chapter concerns the modelling of a workshop with the discrete-event simulation methodology. Production simulation is strongly used in some fields as automobile industry but is less used in shipbuilding. Indeed, the difficulty is that almost each piece to produce is unique. The objective is to show the importance of production simulation for such workshops. The modelled workshop is linked to a genetic algorithm to improve its productivity by optimizing its production sequence. Secondly a tool of creation and optimization of PERT networks has been created. The tool contains a graphical interface to easily handle networks and an optimization algorithm. This last one can minimize total cost of any project for a given total time. The tool has been linked to the modelled workshop. Consequently we get a PERT diagram of the workshop that can highlight critical activities. Finally, the last chapter explains the development of a tool to solve space allocation problems. Indeed space is often a critical point in many shipyards. Thanks to a user-friendly interface, the developed tool facilitates scheduling of these workshops. Furthermore it contains an optimization algorithm based on a heuristic approach to automate the planning process. In conclusion a set of efficient tools has been carried out with concrete applications on real workshops./Lobjectif de la thèse est de développer une série doutils qui permettent doptimiser la production dateliers de construction navale. Ces outils sont testés sur des ateliers du Chantier Naval Aker Yards France à Saint-Nazaire. Le chapitre principal traite de la modélisation dun atelier dit de PréPréFabrication sur le principe de la simulation de production à évènements discrets. La simulation de production est fortement utilisée dans certains domaines industrie automobile par exemple mais encore peu souvent en construction navale. En effet, la difficulté réside dans la diversité des pièces à produire. Lobjectif est de démontrer lintérêt de la simulation de production même dans ces ateliers où pratiquement chaque pièce à construire est unique. Latelier modélisé a été couplé avec un algorithme génétique pour améliorer sa productivité en optimisant la séquence de production. En second lieu, un outil de création et doptimisation des réseaux PERT a été créé. Loutil contient une interface graphique permettant une manipulation aisée des réseaux et un algorithme doptimisation. Ce dernier permet de minimiser le coût de réalisation dun projet pour un temps total fixé. En étant couplé avec le logiciel de simulation développé, une création automatique du diagramme PERT de latelier est créée, permettant de mettre clairement en évidence ses activités critiques. Finalement, le dernier chapitre de la thèse porte sur la création dun logiciel permettant de résoudre les problèmes de gestion de surface et de planification rencontrés dans certains chantiers. En effet, lespace au sol est un élément critique pour beaucoup dateliers de construction navale. Le logiciel développé, grâce à une interface conviviale et pratique, permet de faciliter grandement la planification. De plus, il contient un algorithme doptimisation basé sur des heuristiques afin dautomatiser le processus de planification. En conclusion, un ensemble doutils efficaces a été généré, avec des applications concrètes sur des ateliers réels.

Container terminals use intelligent freight technologies (e.g., EDI, RFID and GPS) to exchange data with their partners, to locate containers and equipment within the terminal, and to automate tasks. This thesis illustrated, via two examples, how this data may be used to optimize operations at the terminal.The first part uses information on announced volumes to allocate internal handling equipment. The objective is to minimize overall delays at the terminal. The problem is represented as a network flow problem and implemented as a linear mixed integer programming model. A case study for a terminal at the Grand Port Maritime de Marseille is carried out. We also showed that combining the allocation problem with the dimensioning of a truck appointment system may reduce overall delays at the terminal. The second part uses information on announced container retrievals and container positions to improve retrieval operations. The objective is to retrieve containers from a bay in a given sequence with a minimum number of parasite relocations. We improve an existing binary programming model and introduce an exact branch and price approach - with a binary subproblem and two variants of an enumerative subproblem - and a heuristic branch and price approach - with a heuristic subproblem. The exact approach solves only small instances; the heuristic approach performs well on several instances, but should be improved further. We also deal with a dynamic version of the problem where the retrieval order becomes revealed over time and evaluate different relocation strategies for this case.

We develop solution methods for the air defense problem of a naval task group in this dissertation. We consider two interdependent problems. The first problem is the optimal allocation of a set of defensive missile systems of a naval task group to a set of attacking air targets. We call this problem the Missile Allocation Problem (MAP). The second problem called the Sector Allocation Problem (SAP) is the determination of a robust air defense formation for a naval task group by locating ships in predefined sectors on the surface. For MAP, we present three different mixed integer programming formulations. MAP by its nature requires real time solution. We propose efficient heuristic solution procedures that satisfy the demanding time requirement of MAP. We also develop mathematical programming models for SAP. Proposed branch and bound solution scheme for SAP yields highly satisfactory solutions. We characterize the interaction between MAP and SAP and develop an integrated solution approach.

Informed economic decisions are made on the basis of accounting data. It is therefore crucial to have rigorous and scientific approaches for measuring, modelling and forecasting accounting numbers. Dr Falta's research was motivated by two observations. Firstly, in accounting practice, decision-making often relies on subjective quantifications and forecasts of business activities and, thus, does not account for uncertainty in a rational way. Secondly, there are some academic foundations for statistical approaches to accounting, yet none has been developed carefully enough for results to penetrate and to contribute to practitioners' needs. Dr Falta applied components of mathematics, statistics, econometrics, finance and computing to aspects of accounting and auditing. He developed an enhanced framework for scientific measurement of business process costing and recording accounting transaction data. This has enabled a better understanding of risk in accounting-based decision-making. His research is being incorporated in projects with the Royal Australian Navy and SunWater.

Orientadores: Luiz Leduino de Salles Neto, Antonio Carlos Moretti / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-23T22:02:01Z (GMT). No. of bitstreams: 1 Cereser_BrunoLuisHonigmann_M.pdf: 8696662 bytes, checksum: b4ca681ecf08f10afa47d00b3a879e9e (MD5) Previous issue date: 2013 / Resumo: O transporte marítimo é fundamental para grandes empresas de caráter global. Em 2009 80% do comércio mundial foi realizado via transporte marítimo e desde então esse número só tem crescido. Devido a esse alto fluxo nos portos mundiais, surgiu o problema de alocação de navios em berços, que tem por finalidade estabelecer uma sequência de atendimento de navios para cada berço disponível no cais, visando minimizar o tempo total da operação e espera dos navios dentro dos portos. Nesse trabalho o problema de alocação de navios em berços será abordado considerando berços dependentes, e também a divisão das máquinas portuárias em berços consecutivos aplicados a terminais do Porto de Tubarão (ES). Para a representação matemática dos processos desses terminais do porto de tubarão foram desenvolvidos novos modelos matemáticos. Os testes computacionais foram exitosos / Abstract: The maritime transportation is essential to global companies. In 2009 80% of global trade was made by maritime transportation, and over the year this number has raised. Because of this high flux, the BAP (Berth Allocation Problem) arose. The BAP have intent to discovery the vessel allocation sequence in every berth with the minimum total wait time. In this work, the berths of BAP will be considered dependents, we also considered the division of portuary machines between consecutive berths. The objective of this work is the mathematical representation of the terminals Produtos Diversos and Praia Mole of the Tubarão port. For this reasons we propose here unprecedented mathematical models / Mestrado / Matematica Aplicada / Mestre em Matemática Aplicada

Maintaining and operating manual main distribution frames is labour-intensive. As a result, Automated Main Distribution Frames (AMDFs) have been developed to alleviate the task of maintaining subscriber loops. Commercial AMDFs are currently employed in telephone exchanges in some parts of the world. However, the most significant factors limiting their widespread adoption are costeffective scalability and reliability. Therefore, an impelling incentive is provided to create a simulation framework in order to explore typical implementations and scenarios. Such a framework will allow the evaluation and optimisation of a design in terms of both internal and external redundancies. One of the approaches to improve system performance, such as system reliability, is to allocate the optimal redundancy to all or some components in a system. Redundancy at the system or component levels can be implemented in one of two schemes: parallel redundancy or standby redundancy. It is also possible to mix these schemes for various components. Moreover, the redundant elements may or may not be of the same type. If all the redundant elements are of different types, the redundancy optimisation model is implemented with component mixing. Conversely, if all the redundant components are identical, the model is implemented without component mixing. The developed framework can be used both to develop new AMDF architectures and to evaluate existing AMDF architectures in terms of expected lifetimes, reliability and service availability. Two simulation models are presented. The first simulation model is concerned with optimising central office equipment within a telephone exchange and entails an environment of clients utilising services. Currently, such a model does not exist. The second model is a mathematical model incorporating stochastic simulation and a hybrid intelligent evolutionary algorithm to solve redundancy allocation problems. For the first model, the optimal partitioning of the model is determined to speed up the simulation run efficiently. For the second model, the hybrid intelligent algorithm is used to solve the redundancy allocation problem under various constraints. Finally, a candidate concept design of an AMDF is presented and evaluated with both simulation models. / Dissertation (MEng)--University of Pretoria, 2013. / gm2014 / Electrical, Electronic and Computer Engineering / unrestricted

Electrical energy is one of the most common forms of energy these days. Consequently, electric power system is an indispensable part of any society. However, due to the deregulation of electricity markets and the growth in the share of power generation by uncontrollable renewable energies such as wind and solar, power system simulations are more challenging than earlier. Thus, new techniques for simplifying these simulations are needed. One important example of such simplification techniques is the power system reduction. Power system reduction can be used at least for four different purposes: a) Simplifying the power system simulations, b) Reducing the computational complexity, c) Compensating the data unavailability, and d) Reducing the existing uncertainty. Due to such reasons, power system reduction is an important and necessary subject, but a challenging task to do. Power system reduction is even more essential when system operators are facing very large-scale power systems and when the renewable energy resources like hydro, wind, and solar have a high share in power generation. This thesis focuses on the topic of large-scale power system reduction with high penetration of renewable energy resources and tries to pursue the following goals: • The thesis first reviews the different methods which can be used for simplifying the power system studies, including the power system reduction. A comparison among three important simplification techniques is also performed to reveal which simplification results in less error and more simulation time decrement. • Secondly, different steps and methods for power system reduction, including network aggregation and generation aggregation, are introduced, described and discussed. • Some improvements regarding the subject of power system reduction, i.e. on both network aggregation and generation aggregation, are developed. • Finally, power system reduction is applied to some power system problems and the results of these applications are evaluated. A general conclusion is that using power system simplification techniques and specially the system reduction can provides many important advantages in studying large-scale power systems with high share of renewable energy generations. In most of applications, not only the power system reduction highly reduces the complexity of the power system study under consideration, but it also results in small errors. Therefore, it can be used as an efficient method for dealing with current bulk power systems with huge amounts of renewable and distributed generations. / <p>The Doctoral Degrees issued upon completion of the programme are issued by Comillas Pontifical University, Delft University of Technology and KTH Royal Institute of Technology. The invested degrees are official in Spain, the Netherlands and Sweden, respectively. QC 20150116</p>

The economic growth and the increase in population has led to an increased demand for water for various purposes such as domestic consumption, irrigation, industrial use, power generation, navigation, recreation, and ecological requirements. With the increase in population, the per-capita water availability is continuously decreasing. Due to increase in demand and accompanying scarcity of water the conflict among the potential users of the resource is on raise. Hence, the allocation of the available water resource is a big challenge as the intersect oral and inter-regional water allocation is often competing and conflicting in nature. In the above context a good model to manage the available water resources would require reliable inputs on the available water resources. In the first part of this thesis we compare different techniques that are typically used for modeling the river water flow. Time series analysis (ARIMA) is compared with machine learning techniques such as support-vector regression (SVR) and neural network models. The performance of these techniques is compared by applying them to a long-term time-series data of the inflows of three tributaries of the river Cauvery into the Krishnaraja Sagar reservoir (KRS). Flow data over a period of 30 years from three different observation points established in upper Cauvery river sub-basin is analyzed. Specifically, a multi-layer feed forward network trained with a back-propagation algorithm and support vector regression with epsilon-insensitive loss function is compared with the ARIMA models. It is found that the performance of support vector regression model is superior to those of the other techniques considered. The second part of our thesis is to develop a model for optimal water allocation to the different sectors with the aim of maximizing the total utility of available water resource in a river basin. A hydro-economic modeling framework is developed that incorporates the economic assessment of the value of water. This inter-sectoral allocation problem is studied in the context of enforcing certain minimum water rights to every person for domestic use and a certain minimum irrigation need set out by the contingency plans of the state agriculture department in Cauvery river basin. A non-linear optimization model is built to obtain an optimal inter-sectoral water allocation policy. The study evaluates the economic impact of different parameters of competing demands such as water availability, population, basic water right (quantity), ground water contribution, and crop benefit. The optimal policies that implements the water allocation priorities as set out by the National Water Policy (2012) are compared. Further, results show that the basic water right can be secured for essential needs with optimal management of available surface and ground water resources. In the third part of thesis, we study the conflict of water sharing that arises between sectors/regions. We consider the river water-sharing problem between two agents along a river. Each agent has a stated claim to the river water. The Absolute Territorial Sovereignty (ATS) and Absolute Territorial Integrity (ATI) principles are promoted by different agents along the river as a means to maximize their individual benefit. However, these principles are invariably considered to be unjust by one or more of the other agents. Hence, it is preferred to have a negotiated water treaty that is perceived to be equitable and just by all. A one way downstream stream bilateral bargaining model can be used to guide the negotiated water treaty between the agents. In this bargaining framework we introduce the issue of negative externalities imposed by the upstream agent on the downstream agent/s in the form of pollution and/or flooding. This imposes a cost on the downstream agent to mitigate losses due to the negative externalities. A bargaining model that incorporates the impact of negative externalities is developed to guide the negotiated treaties. We identify individually rational bargaining strategies for a two agents transferable utility one way downstream river water sharing problem. The results characterize the agreement and disagreement points for bilateral trading