A simulation-based evolutionary multiobjective approach to manufacturing cell formation

The purpose of this paper is to propose a multiobjective optimization approach for solving the manufacturing cell formation problem, explicitly considering the performance of this said manufacturing system. Cells are formed so as to simultaneously minimize three conflicting objectives, namely, the level of the work-in-process, the intercell moves and the total machinery investment. A genetic algorithm performs a search in the design space, in order to approximate to the Pareto optimal set. The values of the objectives for each candidate solution in a population are assigned by running a discrete-event simulation, in which the model is automatically generated according to the number of machines and their distribution among cells implied by a particular solution. The potential of this approach is evaluated via its application to an illustrative example, and a case from the relevant literature. The obtained results are analyzed and reviewed. Therefore, it is concluded that this approach is capable of generating a set of alternative manufacturing cell configurations considering the optimization of multiple performance measures, greatly improving the decision making process involved in planning and designing cellular systems. (C) 2010 Elsevier Ltd. All rights reserved.

Análise de Resultados de Simulações não Estacionárias Aperiódicas e Cíclicas

Tese de Doutoramento, Matemática (Investigação Operacional), 23 de Setembro de 2006, Universidade dos Açores.

Modelos de simulação de processos por junção de componentes

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

Simulationsbasierte Frühwarnsysteme zur Unterstützung der operativen Produktionssteuerung und -planung in der Automobilindustrie

Material flow simulation, Simulation-based Early Warning System, Discrete Event Simulation, Production Planning and Control, Automotive Industry, Forecast of Future System States, Monitoring Systems

Modeling of hybrid systems by piecewise decomposition

Piecewise linear models systems arise as mathematical models of systems in many practical applications, often from linearization for nonlinear systems. There are two main approaches of dealing with these systems according to their continuous or discrete-time aspects. We propose an approach which is based on the state transformation, more particularly the partition of the phase portrait in different regions where each subregion is modeled as a two-dimensional linear time invariant system. Then the Takagi-Sugeno model, which is a combination of local model is calculated. The simulation results show that the Alpha partition is well-suited for dealing with such a system

Simulation methods with extended stability for stiff biochemical kinetics

Background: With increasing computer power, simulating the dynamics of complex systems in chemistry and biology is becoming increasingly routine. The modelling of individual reactions in (bio)chemical systems involves a large number of random events that can be simulated by the stochastic simulation algorithm (SSA). The key quantity is the step size, or waiting time, τ, whose value inversely depends on the size of the propensities of the different channel reactions and which needs to be re-evaluated after every firing event. Such a discrete event simulation may be extremely expensive, in particular for stiff systems where τ can be very short due to the fast kinetics of some of the channel reactions. Several alternative methods have been put forward to increase the integration step size. The so-called τ-leap approach takes a larger step size by allowing all the reactions to fire, from a Poisson or Binomial distribution, within that step. Although the expected value for the different species in the reactive system is maintained with respect to more precise methods, the variance at steady state can suffer from large errors as τ grows. Results: In this paper we extend Poisson τ-leap methods to a general class of Runge-Kutta (RK) τ-leap methods. We show that with the proper selection of the coefficients, the variance of the extended τ-leap can be well-behaved, leading to significantly larger step sizes.Conclusions: The benefit of adapting the extended method to the use of RK frameworks is clear in terms of speed of calculation, as the number of evaluations of the Poisson distribution is still one set per time step, as in the original τ-leap method. The approach paves the way to explore new multiscale methods to simulate (bio)chemical systems.

Prograde mica 40Ar/39Ar growth ages recorded in high pressure rocks (Syros, Cyclades, Greece)

Phengites from the eclogite and blueschist-facies sequences of the Cycladic island of Syros (Greece) have been dated by the in situ UV-laser ablation Ar-40/Ar-39 method. A massive, phengite-rich eclogite and an omphacite-rich metagabbro were investigated. The phengites are eubedral and coarse-grained (several 100 mum), strain-free and exhibit no evidence for late brittle deformation or recrystallization. Apparent ages in these samples range from 43 to 50 Ma for the phengite-rich eclogite and 42 to 52 Ma for the ompbacitic metagabbro. This large spread of ages is visible at all scales-within individual grains as well as in domains of several 100 mum and across the entire sample (ca. 2 cm). Such variations have been traditionally attributed to metamorphic cooling or the incorporation of excess argon. However, the textural equilibrium between the phengites and other high pressure phases and the subtle compositional variations within the phengites, especially the preservation of growth textures, alternatively suggest that the observed range in ages may reflect variations of radiogenic argon acquired during phengite formation and subsequent growth, thus dating a discrete event on the prograde path. This implies that the oldest phengite 40Ar/39Ar ages provide the best estimate of a minimum crystallization age, which is in agreement with recently reported U-Pb and Lu-Hf geochronological data. Our results are consistent with available stable isotope data and further suggest that, under fluid-restricted conditions, both stable and radiogenic isotopic systems can survive without significant isotopic exchange during subduction and exhumation from eclogite-facies P-T conditions. (C) 2004 Elsevier B.V. All rights reserved.

Modeling and Simulation ofReal-Time System as a Tool to Improve Capacity Management - Case Fenix

Tämän tutkimustyön kohteena on TietoEnator Oy:n kehittämän Fenix-tietojärjestelmän kapasiteettitarpeen ennustaminen. Työn tavoitteena on tutustua Fenix-järjestelmän eri osa-alueisiin, löytää tapa eritellä ja mallintaa eri osa-alueiden vaikutus järjestelmän kuormitukseen ja selvittää alustavasti mitkä parametrit vaikuttavat kyseisten osa-alueiden luomaan kuormitukseen. Osa tätä työtä on tutkia eri vaihtoehtoja simuloinnille ja selvittää eri vaihtoehtojen soveltuvuus monimutkaisten järjestelmien mallintamiseen. Kerätyn tiedon pohjaltaluodaan järjestelmäntietovaraston kuormitusta kuvaava simulaatiomalli. Hyödyntämällä mallista saatua tietoa ja tuotantojärjestelmästä mitattua tietoa mallia kehitetään vastaamaan yhä lähemmin todellisen järjestelmän toimintaa. Mallista tarkastellaan esimerkiksi simuloitua järjestelmäkuormaa ja jonojen käyttäytymistä. Tuotantojärjestelmästä mitataan eri kuormalähteiden käytösmuutoksia esimerkiksi käyttäjämäärän ja kellonajan suhteessa. Tämän työn tulosten on tarkoitus toimia pohjana myöhemmin tehtävälle jatkotutkimukselle, jossa osa-alueiden parametrisointia tarkennetaan lisää, mallin kykyä kuvata todellista järjestelmää tehostetaanja mallin laajuutta kasvatetaan.

Improving distributed simulation in a workstation environment

Technological development brings more and more complex systems to the consumer markets. The time required for bringing a new product to market is crucial for the competitive edge of a company. Simulation is used as a tool to model these products and their operation before actual live systems are built. The complexity of these systems can easily require large amounts of memory and computing power. Distributed simulation can be used to meet these demands. Distributed simulation has its problems. Diworse, a distributed simulation environment, was used in this study to analyze the different factors that affect the time required for the simulation of a system. Examples of these factors are the simulation algorithm, communication protocols, partitioning of the problem, distributionof the problem, capabilities of the computing and communications equipment and the external load. Offices offer vast amounts of unused capabilities in the formof idle workstations. The use of this computing power for distributed simulation requires the simulation to adapt to a changing load situation. This requires all or part of the simulation work to be removed from a workstation when the owner wishes to use the workstation again. If load balancing is not performed, the simulation suffers from the workstation's reduced performance, which also hampers the owner's work. Operation of load balancing in Diworse is studied and it is shown to perform better than no load balancing, as well as which different approaches for load balancing are discussed.

Tapahtumapohjainen simulointi kuljetusketjun automatisoinnin kehittämisessä

Työn tavoitteena oli tutkia kuljetusketjun automatisoinnin kehittämistä tapahtumapohjaisen simuloinnin avulla. Työn teoria osassa käsitellään yleisellä tasolla simuloinnin teoriaa, siihen liittyviä käsitteitä ja erityisesti simulointiprojektin läpiviennin vaiheita. Tässä osassa saadaan vastaukset seuraaviin kysymyksiin: - Mitä tapahtumapohjaisella simuloinnilla tarkoitetaan? - Mitkä ovat simuloinnin hyödyt ja rajoitteet? - Mitä käyttökohteita simuloinnilla on? - Minkälaisia ohjelmia simulointiin käytetään? - Mitä vaiheita simulointiprojekti sisältää? Soveltavassa osassa tutkitaan kuinka tapahtumapohjaista simulointia hyödynnettiin Veto-Ketju -projektissa ja millaisia tuloksia rakennetulla simulointimallilla saavutettiin. Veto-Ketju -projekti käsittelee kuljetusketjun sekä varasto- ja satamakäsittelyn tehostamista automatisoinnin avulla. Projektin vetäjänä ja automaattisen tavarankäsittelyjärjestelmän toimittajana on Pesmel Oy ja satamatoimintojen ja logistiikan asiantuntijana SysOpen-konserniin kuuluva suunnittelu- ja konsulttitoimisto EP-Logistics Oy. Paperiteollisuudesta mukana ovat UPM-Kymmene ja M-real, satamaoperaattorina toimii Rauma Stevedoring ja kuljetusoperaattorina VR Cargo. Veto-Ketju –projektin simulointitutkimuksessa varmistettiin suunnitellun automaattisen junavaunujen purkausjärjestelmän toiminta ennen sen käyttöönottoa ja tutkittiin erilaisten toimintatapojen vaikutuksia satamatoimintoihin, satamassa tarvittavien resurssien määrään ja määritettiin tarvittavien varastojen koko. Simulointimallin avulla pystyttiin osoittamaan selkeästi erilaisten toimintavaihtoehtojen erot. Tällä tavoin saatiin tuotetuksi lisää tietoa päätöksenteon tueksi muun muassa järjestelmän sijoituspaikan ja mahdollisen uuden varaston rakentamisen suhteen.

Studies Using Computer Simulation Models to Solve Problems Related to Logistics Terminals

This thesis deals with the use of simulation as a problem-solving tool to solve a few logistic system related problems. More specifically it relates to studies on transport terminals. Transport terminals are key elements in the supply chains of industrial systems. One of the problems related to use of simulation is that of the multiplicity of models needed to study different problems. There is a need for development of methodologies related to conceptual modelling which will help reduce the number of models needed. Three different logistic terminal systems Viz. a railway yard, container terminal of apart and airport terminal were selected as cases for this study. The standard methodology for simulation development consisting of system study and data collection, conceptual model design, detailed model design and development, model verification and validation, experimentation, and analysis of results, reporting of finding were carried out. We found that models could be classified into tightly pre-scheduled, moderately pre-scheduled and unscheduled systems. Three types simulation models( called TYPE 1, TYPE 2 and TYPE 3) of various terminal operations were developed in the simulation package Extend. All models were of the type discrete-event simulation. Simulation models were successfully used to help solve strategic, tactical and operational problems related to three important logistic terminals as set in our objectives. From the point of contribution to conceptual modelling we have demonstrated that clubbing problems into operational, tactical and strategic and matching them with tightly pre-scheduled, moderately pre-scheduled and unscheduled systems is a good workable approach which reduces the number of models needed to study different terminal related problems.

Modeling of hybrid systems by piecewise decomposition

Piecewise linear models systems arise as mathematical models of systems in many practical applications, often from linearization for nonlinear systems. There are two main approaches of dealing with these systems according to their continuous or discrete-time aspects. We propose an approach which is based on the state transformation, more particularly the partition of the phase portrait in different regions where each subregion is modeled as a two-dimensional linear time invariant system. Then the Takagi-Sugeno model, which is a combination of local model is calculated. The simulation results show that the Alpha partition is well-suited for dealing with such a system

Simulation model using meta heuristic algorithms for achieving optimal arrangement of storage bins in a sawmill yard

Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.

ON DISCRETE SYSMMETRIES OF THE MULTI-BOSON KP HIERARCHIES

We show that the multi-boson KP hierarchies possess a class of discrete symmetries linking them to discrete Toda systems. These discrete symmetries are generated by the similarity transformation of the corresponding Lax operator. This establishes a canonical nature of the discrete transformations. The spectral equation, which defines both the lattice system and the corresponding Lax operator, plays a key role in determining pertinent symmetry structure. We also introduce the concept of the square root lattice leading to a family of new pseudo-differential operators with covariance under additional Backlund transformations.

On discrete symmetries of the multi-boson KP hierarchies

We show that the multi-boson KP hierarchies possess a class of discrete symmetries linking them to discrete Toda systems. These discrete symmetries are generated by the similarity transformation of the corresponding Lax operator. This establishes a canonical nature of the discrete transformations. The spectral equation, which defines both the lattice system and the corresponding Lax operator, plays a key role in determining pertinent symmetry structure. We also introduce the concept of the square root lattice leading to a family of new pseudo-differential operators with covariance under additional Bäcklund transformations.