The governmental organization's role in railway freight market's liberalization -building knowledge through Swedish and Polish operators' experiences

Globalization has increased transport aggregates’ demand. Whilst transport volumes increase, ecological values’im portance has sharpened: carbon footprint has become a measure known world widely. European Union together with other communities emphasizes friendliness to the environment: same trend has extended to transports. As a potential substitute for road transport is noted railway transport, which decreases the congestions and lowers the emission levels. Railway freight market was liberalized in the European Union 2007, which enabled new operators to enter the markets. This research had two main objectives. Firstly, it examined the main market entry strategies utilized and the barriers to entry confronted by the operators who entered the markets after the liberalization. Secondly, the aim was to find ways the governmental organization could enhance its service towards potential railway freight operators. Research is a qualitative case study, utilizing descriptive analytical research method with a normative shade. Empirical data was gathered by interviewing Swedish and Polish railway freight operators by using a semi-structured theme-interview. This research provided novel information by using first-hand data; topic has been researched previously by utilizing second-hand data and literature analyses. Based on this research, rolling stock acquisition, needed investments and bureaucracy generate the main barriers to entry. The research results show that the mostly utilized market entry strategies are start-up and vertical integration. The governmental organization could enhance the market entry process by organizing courses, paying extra attention on flexibility, internal know-how and educating the staff.

Matkustajainformaatiojärjestelmän toteuttaminen junaan

Matkustajainformaatio junassa koostuu vaunujen ulkopuolisilla kylkinäytöillä esitettävistä junan lähtö-, väli- ja määräasematiedoista yhdessä junan ja vaunujen myyntinumeroiden kanssa sekä vaunujen sisäpuolella automaattisista kuulutuksista ja matkustamon näytöillä esitettävästä staattisesta ja vaihtuvasta informaatiosta. Työssä toteutetaan matkustajainformaatiojärjestelmä käytettäväksi matkustajunissa. Järjestelmään syötetään ennen matkan alkua junan tiedot, jonka jälkeen se toimii automaattisesti ilman tarvetta junahenkilökunnan toimenpiteille. Poikkeustilanteissa junahenkilökunta voi estää järjestelmän toiminnan tai valita esiohjelmointuja erikoiskuulutuksia. Toteuttamismenetelmäksi valittiin C-ohjelmointikieli Linux-käyttöjärjestelmällä varustetulla sulautetulla rautatiekäyttöön suunnitellulla laitealustalla.

Researching Manufacturing Planning and Control system and Master Scheduling in a manufacturing firm.

The objective of this thesis is to research Manufacturing Planning and Control (MPC) system and Master Scheduling (MS) in a manufacturing firm. The study is conducted at Ensto Finland Corporation, which operates on a field of electrical systems and supplies. The paper consists of theoretical and empirical parts. The empirical part is based on weekly operating at Ensto and includes inter-firm material analysis, learning and meetings. Master Scheduling is an important module of an MPC system, since it is beneficial on transforming strategic production plans based on demand forecasting into operational schedules. Furthermore, capacity planning tools can remarkably contribute to production planning: by Rough-Cut Capacity Planning (RCCP) tool, a MS plan can be critically analyzed in terms of available key resources in real manufacturing environment. Currently, there are remarkable inefficiencies when it comes to Ensto’s practices: the system is not able to take into consideration seasonal demand and react on market changes on time; This can cause significant lost sales. However, these inefficiencies could be eliminated through the appropriate utilization of MS and RCCP tools. To utilize MS and RCCP tools in Ensto’s production environment, further testing in real production environment is required. Moreover, data accuracy, appropriate commitment to adapting and learning the new tools, and continuous developing of functions closely related to MS, such as sales forecasting, need to be ensured.

Harvesting and wood transport planning with SNAP III program (Scheduling and Network Analysis Program) in a pine plantation in Southeast Brazil

The objective of this study was to verify the potential of SNAP III (Scheduling and Network Analysis Program) as a support tool for harvesting and wood transport planning in Brazil harvesting subsystem definition and establishment of a compatible route were assessed. Initially, machine operational and production costs were determined in seven subsystems for the study area, and quality indexes, construction and maintenance costs of forest roads were obtained and used as SNAP III program input data. The results showed, that three categories of forest road occurrence were observed in the study area: main, secondary and tertiary which, based on quality index, allowed a medium vehicle speed of about 41, 30 and 24 km/hours and a construction cost of about US$ 5,084.30, US$ 2,275.28 and US$ 1,650.00/km, respectively. The SNAP III program used as a support tool for the planning, was found to have a high potential tool in the harvesting and wood transport planning. The program was capable of defining efficiently, the harvesting subsystem on technical and economical basis, the best wood transport route and the forest road to be used in each period of the horizon planning.

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.

Development of railway logistics’ information flows

Objective of this thesis was to develop the exchange of information and reduce the manual work done in the supply chain. In addition, the possibility to introduce electronic information exchange was studied between suppliers and Borealis. The aim was to create an accurate picture of Borealis’ current information flows and create from the basis of it short- and long-term improvement and development proposals. In this study the company's received and send information flows were mapped by interviewing persons who were responsible for the railroad imports and by examining documents that are used in the exchange of information. The data content of the information flows were prioritized and only the most important information contents were used for further development. Literature data was acquired concerning knowledge of electronic data interchange and information management to support the decisions and proposals. Long-term development proposals were compared with each other and the best one of them was recommended for further study. The final target of the proposal is to be able to receive electronic data and create an own database where to the information is stored and where from it is possible to follow up the rail tank cars and where from the needed reports can be retrieved.

Aging based maintenance and reinvestment scheduling of electric distribution

The maintenance of electric distribution network is a topical question for distribution system operators because of increasing significance of failure costs. In this dissertation the maintenance practices of the distribution system operators are analyzed and a theory for scheduling maintenance activities and reinvestment of distribution components is created. The scheduling is based on the deterioration of components and the increasing failure rates due to aging. The dynamic programming algorithm is used as a solving method to maintenance problem which is caused by the increasing failure rates of the network. The other impacts of network maintenance like environmental and regulation reasons are not included to the scope of this thesis. Further the tree trimming of the corridors and the major disturbance of the network are not included to the problem optimized in this thesis. For optimizing, four dynamic programming models are presented and the models are tested. Programming is made in VBA-language to the computer. For testing two different kinds of test networks are used. Because electric distribution system operators want to operate with bigger component groups, optimal timing for component groups is also analyzed. A maintenance software package is created to apply the presented theories in practice. An overview of the program is presented.

Scheduling of guarded command based models

Formal methods provide a means of reasoning about computer programs in order to prove correctness criteria. One subtype of formal methods is based on the weakest precondition predicate transformer semantics and uses guarded commands as the basic modelling construct. Examples of such formalisms are Action Systems and Event-B. Guarded commands can intuitively be understood as actions that may be triggered when an associated guard condition holds. Guarded commands whose guards hold are nondeterministically chosen for execution, but no further control flow is present by default. Such a modelling approach is convenient for proving correctness, and the Refinement Calculus allows for a stepwise development method. It also has a parallel interpretation facilitating development of concurrent software, and it is suitable for describing event-driven scenarios. However, for many application areas, the execution paradigm traditionally used comprises more explicit control flow, which constitutes an obstacle for using the above mentioned formal methods. In this thesis, we study how guarded command based modelling approaches can be conveniently and efficiently scheduled in different scenarios. We first focus on the modelling of trust for transactions in a social networking setting. Due to the event-based nature of the scenario, the use of guarded commands turns out to be relatively straightforward. We continue by studying modelling of concurrent software, with particular focus on compute-intensive scenarios. We go from theoretical considerations to the feasibility of implementation by evaluating the performance and scalability of executing a case study model in parallel using automatic scheduling performed by a dedicated scheduler. Finally, we propose a more explicit and non-centralised approach in which the flow of each task is controlled by a schedule of its own. The schedules are expressed in a dedicated scheduling language, and patterns assist the developer in proving correctness of the scheduled model with respect to the original one.

Deregulation’s Impact on the Railway Freight Transport Sector’s Future in the Baltic Sea Region

The European transport market has confronted several changes during the last decade. Due to European Union legislative mandates, the railway freight market was deregulated in 2007. The market followed the trend started by other transport modes as well as other previously regulated industries such as banking, telecommunications and energy. Globally, the first country to deregulate the railway freight market was the United States, with the introduction of the Staggers Rail Act in 1980. Some European countries decided to follow suit already before regulation was mandated; among the forerunners were the United Kingdom, Sweden and Germany. The previous research has concentrated only on these countries, which has provided an interesting research gap for this thesis. The Baltic Sea Region consists of countries with different kinds of liberalization paths, including Sweden and Germany, which have been on the frontline, whereas Lithuania and Finland have only one active railway undertaking, the incumbent. The transport market of the European Union is facing further challenges in the near future, due to the Sulphur Directive, oil dependency and the changing structure of European rail networks. In order to improve the accessibility of this peripheral area, further action is required. This research focuses on topics such as the progression of deregulation, barriers to entry, country-specific features, cooperation and internationalization. Based on the research results, it can be stated that the Baltic Sea Region’s railway freight market is expected to change in the future. Further private railway undertakings are anticipated, and these would change the market structure. The realization of European Union’s plans to increase the improved rail network to cover the Baltic States is strongly hoped for, and railway freight market counterparts inside and among countries are starting to enhance their level of cooperation. The Baltic Sea Region countries have several special national characteristics which influence the market and should be taken into account when companies evaluate possible market entry actions. According to thesis interviews, the Swedish market has a strong level of cooperation in the form of an old-boy network, and is supported by a positive attitude of the incumbent towards the private railway undertakings. This has facilitated the entry process of newcomers, and currently the market has numerous operating railway undertakings. A contrary example was found from Poland, where the incumbent sent old rolling stock to the scrap yard rather than sell it to private railway undertakings. The importance of personal relations is highlighted in Russia, followed by the railway market’s strong political bond with politics. Nonetheless, some barriers to entry are shared by the Baltic Sea Region, the main ones being acquisition of rolling stock, bureaucracy and needed investments. The railway freight market is internationalizing, which is perceived via several alliances as well as the increased number of mergers and acquisitions. After deregulation, markets seem to increase the number of railway undertakings at a rather fast pace, but with the passage of time, the larger operators tend to acquire smaller ones. Therefore, it is expected that in a decade’s time, the number of railway undertakings will start to decrease in the deregulation pioneer countries, while the ones coming from behind might still experience an increase. The Russian market is expected to be totally liberalized, and further alliances between the Russian Railways and European railway undertakings are expected to occur. The Baltic Sea Region’s railway freight market is anticipated to improve, and, based on the interviewees’ comments, attract more cargoes from road to rail.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Production planning and optimization of a pulp mill: introduction of the optimisation based scheduling software for pulp industry

The objective of this project was to introduce a new software product to pulp industry, a new market for case company. An optimization based scheduling tool has been developed to allow pulp operations to better control their production processes and improve both production efficiency and stability. Both the work here and earlier research indicates that there is a potential for savings around 1-5%. All the supporting data is available today coming from distributed control systems, data historians and other existing sources. The pulp mill model together with the scheduler, allows what-if analyses of the impacts and timely feasibility of various external actions such as planned maintenance of any particular mill operation. The visibility gained from the model proves also to be a real benefit. The aim is to satisfy demand and gain extra profit, while achieving the required customer service level. Research effort has been put both in understanding the minimum features needed to satisfy the scheduling requirements in the industry and the overall existence of the market. A qualitative study was constructed to both identify competitive situation and the requirements vs. gaps on the market. It becomes clear that there is no such system on the marketplace today and also that there is room to improve target market overall process efficiency through such planning tool. This thesis also provides better overall understanding of the different processes in this particular industry for the case company.

Map illustrating the site of the harbours for the proposed Obi-railway : the soundings are all calculated in feet and are based upon the data of the Russian Marine Ministry : the underlined figures are soundings taken by the scooner Bakan, 1887

Kartta kuuluu A. E. Nordenskiöldin kokoelmaan

Map of the north coast of Russia indicating the proposed trade route of the Obi-railway

Kartta kuuluu A. E. Nordenskiöldin kokoelmaan