A discrete-event model to simulate the effect of truck bunching due to payload variance on cycle time, hauled mine materials and fuel consumption

Data collected from truck payload management systems at various surface mines shows that the payload variance is significant and must be considered in analysing the mine productivity,energy consumption,greenhouse gas emissions and associated cost.Payload variance causes significant differences in gross vehicle weights.Heavily loaded trucks travel slower up ramps than lightly loaded trucks.Faster trucks are slowed by the presence of slower trucks,resulting in‘bunching’,production losses and increasing fuel consumptions.This paper simulates the truck bunching phenomena in large surface mines to improve truck and shovel systems’efficiency and minimise fuel consumption.The study concentrated on completing a practical simulation model based on a discrete event method which is most commonly used in this field of research in other industries.The simulation model has been validated by a dataset collected from a large surface mine in Arizona state,USA.The results have shown that there is a good agreement between the actual and estimated values of investigated parameters.

Reliability Assessment of Distribution SystemBased on Discrete-event System

Discrete-event system simulation technology is used to analyze distribution system reliability in this paper. A simulation model, including entity state models, system state models, state transition models, reliability criterion model, is established. ‘Next happen event’ is taken as impulse principle of simulator clock to determine the sequence of random event occurrence dynamically. The results show this method is feasible.

A Survey of the Use of the Discrete-event Simulation in Manufacturing Industry

In this work, a survey of companies has been produc ed from a questionnaire and in-depth inter-views. The aimof the paper is to give a current view of the use of DES (Discrete- Event Simulation) in the indust ry. The companies have been selected in a wide range in e.g. size, capital turno ver and employees. The survey was restricted to Sweden, although the results may be applicable to other countries with similar industrial structure. Some of the companies investigated are also multinational with branches around the world. T o illustrate the differences in production systems different sectors have be en investigated, e.g. the manufacturing industry and energy sector. The manufact uring systems generally differ in that the energy sector is more known for high reliability in their systems and the manufacturing sector tends to work more wit h lean production. Previous surveys of manufacturing efficiency illustrate different aspects. Accor ding to one survey, more than one-third (34%) of the disturbances in two countr ies (the U.S. and Finland) were mainly caused by design-based errors and flaws. The survey also showed the scope of safety problems experienced in the implemen tation and use of flexible manufacturing systems (Jrvinen et al., 1996). Another survey in Germany reports a gap between users and non-users of DES. Man y companies that are not familiar with simulation are not aware of its benefits. The study suggested integrating simulation into the planning processes as a reg ular tool. So far, DES is mostly used in system planning, resource planning and scheduling and production planning (Hirschberg & Heitmann, 1997). The disposition of the accomplished questionnaire had been multiple-choice ques tions in a strict order. The respondents gave their views on what the interviewe r considered relevant for the survey. The questionnaire was mailed to 220 person s in May 2001; a second round for unanswered surveys was dispatched in August 20 01. Replies came from 114 respondents; thus, the reply rate to all questionnaire s sent out was 52%. The replies came in from 80 different companies. Questionswere raised regarding what kinds of decisions are taken from a simulation projec t and questions were also asked regarding the tool itself. Some common problems encountered based on the authors’ knowledge were asked in the questionnaire. The questions were sent to those who had reasonable knowledge of how to work with D ES. Supplementary in-depth interviews were also accomplished. On the question if DES facilitates the decision-making process 79% of totally 3 8 answered to a very large or a large extent. Regarding the question if DES is a useful tool for measuring the availability of equipment for example system verification 73% of 33 responded to a very large or a large extent. A majority o f the respondents genuinely see an advantage with the use of simulation, which i s an important result from the study. The cost reduction aspect of the productio n is also an advantage of DES. On the question eight answered to a very large ex tent and 23 to a large extent of total 39 replies. The question demonstrates tha t the results of a simulation model are indeed used in the real world. Finally, in the question of DES is used for staffing it is indicated that it is not so co mmonly used as for other functions asked for. The staffing issue requires good k nowledge about time measurement of manual labor. The option, however, to include manual work in a simulation model is in many programs extensive and must be a v aluable option to evaluate work intensive parts of production lines and their im provement. To conclude, it could be mentioned that DES is a tool with potential. The use is increasing and 12 of 80 companies investigated in Sweden 2001 are using it, an increase compared to previous stud-ies. Of those 12 companies, four are using t he tool to a large extent. The main advantage according to the survey beside the visualization part is that the knowledge about a system is investigated and doc umented.

Discrete-event modeling for internet multi-robotics

Internet multi-robotics is a typical discrete-event system. In order to describe joint activities between multiple operators and multiple robots, a 4-level discrete-event model is proposed in this paper based on the controlled condition/event Petri nets (CCEP). On the first or mission level, the task splitting of the system is defined; on the second or multi-operator level, a precedence graph is introduced for every operator to plan his or her robotic actions; on the third or coordination level, the above precedence graphs are translated and integrated into the corresponding CCEPs in terms of specific rules; and on the last or multi-robot level, operators can select their control range by setting the corresponding control marks of the obtained CCEPs. As a consequence, a clear mechanism of operator-robot collaboration is obtained to conduct the development of the system.

Infinite-and K-Step Opacity Verification of Discrete-Event Systems Under Nondeterministic Observations

In some practical applications modeled by discrete-event systems(DES),the observations of events may be no longer deterministic due to sensor faults/failures,packet loss,and/or measurement uncertainties.In this context,it is interesting to reconsider the infinite-step opacity(∞-SO)and K-step opacity(K-SO)of a DES under abnormal conditions as mentioned.In this paper,the authors extend the notions of∞-SO and K-SO defined in the standard setting to the framework of nondeterministic observations(i.e.,the event-observation mechanism is state-dependent and nondeterministic).Obviously,the extended notions of∞-SO and K-SO are more general than the previous standard ones.To effectively verify them,a matrix-based current state estimator in the context of this advanced framework is constructed using the Boolean semi-tensor product(BSTP)technique.Accordingly,the necessary and sufficient conditions for verifying these two extended versions of opacity are provided as well as their complexity analysis.Finally,several examples are given to illustrate the obtained theoretical results.

THE EIGEN-PROBLEM AND PERIOD ANALYSIS OF THE DISCRETE-EVENT SYSTEM

In this paper we provide a sufficient and necessary condition for the eigenvalueand eigenvector of a general reducible matrix in a discrete-event system described by the“max”algebra,analyse the steady periodical performance of the system,and obtain ananalytic solution of the dynamic equation.We propose the conception of“order-d-(?)-block-periodical matrix”and obtain its sufficient and necessary condition and provide an algorithmof (?) matrix.

Queue reduction in discrete-event systems by relabeling

The customer population of entities potentially requesting to join a queue for service often have identical structure, i.e., the same state set and isomorphic transitions. The state size of the automaton modeling a queue will grow rapidly with increase of the size of this population. However, by relabeling the queue arrival events and service events to the same symbols respectively, the automaton model of a queue will be converted to the structure of a buffer, which is proved to be independent of the total size of the customer population, as long as the queue size is held fixed. We propose the model of a dynamic buffer to embody order and shift of a queue. The result is applied to a manufacturing facility with a dynamic buffer to manage the repair of broken down machines.

Supervisory control of concurrent discrete-event systems

Concurrency is a common feature in most industrial systems,where several components can execute different actions simultaneously.In this paper,we first introduce a new feasible nonblocking concurrent supervisory control map for a concurrent system,and subsequently,new concepts of concurrent controllability and concurrent observability.Then we present a sufficient and necessary condition for the existence of a feasible nonblocking concurrent supervisory controlmap to achieve a given concurrent language.After introducing a new concept of prefix-closed concurrent normality,we show that the supremal concurrently controllable and prefix-closed concurrently normal sublanguages exist and are computable.Our emphasis here is not to address the computational efficiency of solving concurrent supervisory control problems,which is still a technical challenge,but to show that the commonly used Ramadge–Wonham asynchronous control is simply a special case of our proposed concurrent control framework by providing an insightful treatment on compound events.

Discrete-event stochastic systems with correlated inputs: Modeling and performance evaluation

In the majority of the previous works on discrete-event stochastic systems,they have been assumed to have independent input processes.However,in many applications,these input processes can be highly correlated.Furthermore,the performance measures of the systems with correlated inputs can be significantly different from those with independent inputs.In this paper,we provide an overview on some commonly used methods for modeling correlated input processes,and we discuss the difficulties and possible future research topics in the study of discrete-event stochastic systems with correlated inputs.

Object-oriented World-view for Discrete-Event Simulation Modelling

Object-oriented world-view provides a natural and powerful paradignl for expressing system elements and their dynamic behaviour for discrete-event simulation. Simulation gives the critical ability to study the dynamic behaviour of the models that are defined with object-voriented means. This paper first examines the ways of applying the object-oriented world-view to three major discrete simulation modelling approaches, then considers the process and merits of object-oriented simulation modelling.

A Parallel Discrete Event Simulation Engine for the Low-Earth-Orbit Satellite Constellation Networks

Low-Earth-Orbit satellite constellation networks(LEO-SCN)can provide low-cost,largescale,flexible coverage wireless communication services.High dynamics and large topological sizes characterize LEO-SCN.Protocol development and application testing of LEO-SCN are challenging to carry out in a natural environment.Simulation platforms are a more effective means of technology demonstration.Currently available simulators have a single function and limited simulation scale.There needs to be a simulator for full-featured simulation.In this paper,we apply the parallel discrete-event simulation technique to the simulation of LEO-SCN to support large-scale complex system simulation at the packet level.To solve the problem that single-process programs cannot cope with complex simulations containing numerous entities,we propose a parallel mechanism and algorithms LP-NM and LP-YAWNS for synchronization.In the experiment,we use ns-3 to verify the acceleration ratio and efficiency of the above algorithms.The results show that our proposed mechanism can provide parallel simulation engine support for the LEO-SCN.

Timed Petri Net Models of Shared-Memory Bus-Based Multiprocessors

In shared-memory bus-based multiprocessors, when the number of processors grows, the processors spend an increasing amount of time waiting for access to the bus (and shared memory). This contention reduces the performance of processors and imposes a limitation of the number of processors that can be used efficiently in bus-based systems. Since the multi-processor’s performance depends upon many parameters which affect the performance in different ways, timed Petri nets are used to model shared-memory bus-based multiprocessors at the instruction execution level, and the developed models are used to study how the performance of processors changes with the number of processors in the system. The results illustrate very well the restriction on the number of processors imposed by the shared bus. All performance characteristics presented in this paper are obtained by discrete-event simulation of Petri net models.

Modeling and Performance Analysis of Weighted Priority Queueing for Packet-Switched Networks

Weighted priority queueing is a modification of priority queueing that eliminates the possibility of blocking lower priority traffic. The weights assigned to priority classes determine the fractions of the bandwith that are guaranteed for individual traffic classes, similarly as in weighted fair queueing. The paper describes a timed Petri net model of weighted priority queueing and uses discrete-event simulation of this model to obtain performance characteristics of simple queueing systems. The model is also used to analyze the effects of finite queue capacity on the performance of queueing systems.

On the design and selection of vehicle coordination policies for underground mine production ramps

Traffic management in underground mines,especially on production ramps,is a difficult problem to optimize and control.Most operations use one of a few common policies;e.g.,the so-called ‘‘lock-out" and‘‘loaded-vehicle-priority" policies.The work presented in this paper uses discrete-event simulation to study the efficiency of multiple policies.Based on simulation results,an improvement to the common lock-out policy is proposed.This new policy utilizes the rules of the lock-out policy but integrates an option that allows a group of vehicles to be given temporary priority in a certain direction of travel.Quantitative results are provided and,based on these,a systematic technique for ramp design that aims to optimize the efficiency of underground mine ramp traffic flow is described.

Estimating optimal substitution scale of urban gasoline taxis by electric taxis in the era of green energy:a case study of Zhengzhou City

Electric Taxis(ETs)are the most favored alternatives to Gasoline Taxis(GTs)in cities that aim to reduce environmental pollution.How to develop a reasonable scale on which GTs are substituted by ETs remains a challenge to governments due to the dynamics and complexity of the taxi system.To address this challenge,this paper develops a discrete-event-based simulation framework to simulate participants in the system and estimate the results under different substitution scales,which are helpful to understanding the status changing law of entities under different substitution scales,such as the operating indices of ETs,the unsatisfied travel requirements of passengers,and the usage state of charging facilities.The framework abstracts the behavioral process of ETs into three elements,namely,entity,behavior,and event.The entities are constructed from the information derived from the trajectory data.The behaviors are defined by rules following behavioral logic under anxiety psychology,which is caused by the limited range of ETs.The events are triggered based on rules from reality.With the help of this framework,a multi-objective optimization model is developed to obtain the optimal substitution scale of GTs in the case study area of Zhengzhou City.Overall,the approach could provide a practical tool to address this challenge,which could support further studies of the effect of ETs on urban taxis.

Machine Allocation in Semiconductor Wafer Fabrication Systems:A Simulation-Based Approach

The problem of maximizing the throughput of Semiconductor Wafer Fabrication Systems is addressed.We model the fabrication systems as a Stochastic Timed Automata and design a discrete-event simulation scheme.The simulation scheme is explicit,fast and achieves high fidelity which captures the feature of reentrant process flow and is flexible to accommodate diversified wafer lot scheduling policies.A series of Marginal Machine Allocation Algorithms are proposed to sequentially allocate machines.Numerical experiments suggest the designed methods are efficient to find good allocation solutions.

DYNAMIC RESOURCE ALLOCATION FOR EFFICIENT PATIENT SCHEDULING： A DATA-DRIVEN APPROACH

Efficient staff rostering and patient scheduling to meet outpatient demand is a very complex and dynamic task. Due to fluctuations in demand and specialist availability, specialist allocation must be very flexible and non-myopic. Medical specialists are typically restricted in sub-specialization, serve several patient groups and are the key resource in a chain of patient visits to the clinic and operating room （OR）. To overcome a myopic view of once-off appointment scheduling, we address the patient flow through a chain of patient appointments when allocating key resources to different patient groups. We present a new, data-driven algorithmic approach to automatic allocation of specialists to roster activities and patient groups. By their very nature, simplified mathematical models cannot capture the complexity that is characteristic to the system being modeled. In our approach, the allocation of specialists to their day-to-day activities is flexible and responsive to past and present key resource availability, as well as to past resource allocation. Variability in roster activities is actively minimized, in order to enhance the supply chain flow. With discrete-event simulation of the application case using empirical data, we illustrate how our approach improves patient Service Level （SL, percentage of patients served on-time） as well as Wait Time （days）, without change in resource capacity.

P-Tree Structures and Event Horizon： Efficient Event-Set Implementations

This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree （or/P-tree, BP-tree, and IBP-tree, respectively, for short）, for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.

Comparison of alternative route selection strategies based on simulation optimization

Air traffic flow management(ATFM) is a collaborative process between the airspace provider and the airspace users. The result of the collaboration should be an outcome that maximizes the utility of the system without excessively penalizing any of the agents. This paper develops a discrete-event simulation model which consists of aggregate departure/arrival airports, flight routes, and sectors for evaluating the alternative collaborative route selection strategy. Given the different perspectives from air traffic control center(ACC) and airlines, eight performancemetrics and five alternative route selection strategies represent the past, current and proposed air traffic flow management operations that were evaluated. The Monte Carlo method combined with the Optimal Computing Budget Allocation(OCBA) simulation optimization technique is employed to assess the performance of different strategies. A case study of the upper air routes in central and southern China shows that the proposed model can be readily implemented to simulate different kinds of air traffic flow management strategies and predict the effect of changes on the airspace system. It also shows that the proposed alternative collaborative route selection strategy is an effective way in alleviating the en-route traffic congestion.

Warehouse automation by logistic robotic networks:a cyber-physical control approach

In this paper we provide a tutorial on the background of warehouse automation using robotic networks and survey relevant work in the literature.We present a new cyber-physical control method that achieves safe,deadlock-free,efficient,and adaptive behavior of multiple robots serving the goods-to-man logistic operations.A central piece of this method is the incremental supervisory control design algorithm,which is computationally scalable with respect to the number of robots.Finally,we provide a case study on 30 robots with changing conditions to demonstrate the effectiveness of the proposed method.