A vehicle for message

Soitinnus: piano, rummut, ääninauha?

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.

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.

Marketing Plan of Electric Vehicle Charging Solutions to USA

The purpose of the Thesis was to evaluate the business environment of electrical vehicle charging equipment (EVSE) in USA, find the key issues of entering the US EVSE markets and to form a marketing plan for possible market entry. The external market research analyzed the environment, customers, competitors and demand of EVSEs. In the internal analysis the focus was on resources and capabilities, offering, performance, business relations and US related issues. The research about the business environment was done using already available information from market studies and seminars. In external analysis there were also two semi-structured interviews from market experts used. The internal analysis was done mostly by interviews, but also company’s internal data sources were used. The interviews were semi-constructed and included eight interviewees from each part of EVSE value chain. The research findings were analyzed using SWOT analysis, which was converted to a so called TOWS matrix for extracting strategies. As a result of the Thesis, valuable information about the US markets and their requirements for EVSEs was gained. By matching the strengths of the case company and market requirements, customer segmentation and targeting were done and a marketing plan was constructed for the case company to help their management to evaluate the feasibility of possible market entry and investments to USA.

Design and Control of Permanent Magnet Synchronous Machine for Hybrid Electric Vehicle

This master’s thesis mainly focuses on the design requirements of an Electric drive for Hybrid car application and its control strategy to achieve a wide speed range. It also emphasises how the control and performance requirements are transformed into its design variables. A parallel hybrid topology is considered where an IC engine and an electric drive share a common crank shaft. A permanent magnet synchronous machine (PMSM) is used as an electric drive machine. Performance requirements are converted into Machine design variables using the vector model of PMSM. Main dimensions of the machine are arrived using analytical approach and Finite Element Analysis (FEA) is used to verify the design and performance. Vector control algorithm was used to control the machine. The control algorithm was tested in a low power PMSM using an embedded controller. A prototype of 10 kW PMSM was built according to the design values. The prototype was tested in the laboratory using a high power converter. Tests were carried out to verify different operating modes. The results were in agreement with the calculations.

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.

Design of salient pole PM synchronous machines for a vehicle traction application – Analysis and

This doctoral thesis presents a study on the development of a liquid-cooled frame salient pole permanent-magnet-exited traction machine for a four-wheel-driven electric car. The emphasis of the thesis is put on a radial flux machine design in order to achieve a light-weight machine structure for traction applications. The design features combine electromagnetic and thermal design methods, because traction machine operation does not have a strict operating point. Arbitrary load cycles and the flexible supply require special attention in the design process. It is shown that accurate modelling of the machine magnetic state is essential for high-performance operation. The saturation effect related to the cross-saturation has to be taken carefully into account in order to achieve the desired operation. Two prototype machines have been designed and built for testing: one totally enclosed machine with a special magnet module pole arrangement and another through-ventilated machine with a more traditional embedded magnet structure. Both structures are built with magnetically salient structures in order to increase the torque production capability with the reluctance torque component. Both machine structures show potential for traction usage. However, the traditional embedded magnet design turns out to be mechanically the more secure one of these two machine options.

Energy Efficiency Consideration in Electric Vehicle Transmission

This study is a survey of benefits and drawbacks of embedding a variable gearbox instead of a single reduction gear in electric vehicle powertrain from efficiency point of view. Losses due to a pair of spur gears meshing with involute teeth are modeled on the base of Coulomb’s law and fluid mechanics. The model for a variable gearbox is fulfilled and further employed in a complete vehicle simulation. Simulation model run for a single reduction gear then the results are taken as benchmark for other types of commonly used transmissions. Comparing power consumption, which is obtained from simulation model, shows that the extra load imposed by variable transmission components will shade the benefits of efficient operation of electric motor. The other accomplishment of this study is a combination of modified formulas that led to a new methodology for power loss prediction in gear meshing which is compatible with modern design and manufacturing technology.

Advances in modelling of mechatronic systems: the toolset FASIM_C++ for the simulation of vehicle dynamics

The increasing complexity of controller systems, applied in modern passenger cars, requires adequate simulation tools. The toolset FASIM_C++, described in the following, uses complex vehicle models in three-dimensional vehicle dynamics simulation. The structure of the implemented dynamic models and the generation of the equations of motion applying the method of kinematic differentials is explained briefly. After a short introduction in methods of event handling, several vehicle models and applications like controller development, roll-over simulation and real-time-simulation are explained. Finally some simulation results are presented.

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.

Behavioral effects of "vehicle" microinjected into the dorsal periaqueductal grey of rats tested in the elevated plus maze

To investigate the behavioral effects of different vehicles microinjected into the dorsal periaqueductal grey (DPAG) of male Wistar rats, weighing 200-250 g, tested in the elevated plus maze, animals were implanted with cannulas aimed at this structure. One week after surgery the animals received microinjections into the DPAG of 0.9% (w/v) saline, 10% (v/v) dimethyl sulfoxide (DMSO), 2% (v/v) Tween-80, 10% (v/v) propylene glycol, or synthetic cerebrospinal fluid (CSF). Ten min after the injection (0.5 &micro;l) the animals (N = 8-13/group) were submitted to the elevated plus maze test. DMSO significantly increased the number of entries into both the open and enclosed arms when compared to 0.9% saline (2.7 &plusmn; 0.8 and 8.7 &plusmn; 1.3 vs 0.8 &plusmn; 0.3 and 5.1 &plusmn; 0.9, respectively, Duncan test, P<0.05), and tended to increase enclosed arm entries as compared to 2% Tween-80 (8.7 &plusmn; 1.3 vs 5.7 &plusmn; 0.9, Duncan test, P<0.10). In a second experiment no difference in plus maze exploration was found between 0.9% saline- or sham-injected animals (N = 11-13/group). These results indicate that intra-DPAG injection of some commonly used vehicles such as DMSO, saline or Tween-80 affects the exploratory activity of rats exposed to the elevated plus maze in statistically different manners

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.

Design and Drive-Cycle Based Analysis of Direct-Driven Permanent Magnet Synchronous Machine for a Small Urban Use Electric Vehicle

A direct-driven permanent magnet synchronous machine for a small urban use electric vehicle is presented. The measured performance of the machine at the test bench as well as the performance over the modified New European Drive Cycle will be given. The effect of optimal current components, maximizing the efficiency and taking into account the iron loss, is compared with the simple id=0 – control. The machine currents and losses during the drive cycle are calculated and compared with each other.

Determining vehicle drivetrain dynamics using system identification

Target of this book is to propose an approach for modelling drivetrain dynamics in order to design further a vibration control system of a hybrid bus. In this thesis two approaches are examined and compared. First model is obtained by theoretical means: drivetrain is represented as a system of rotating masses, which motion is described with differential equations. Second model is obtained using system identification method: mathematical description of the dynamic behavior of a system is formed based on measured input (torque) and output (speed) data. Then two models are compared and an optimal approach is suggested.