AUB ScholarWorks

Generation of random variates for PHDs, MAPs and BMAPs -

Show simple item record

dc.contributor.author Ghizzawi, Farah Nasser,
dc.date.accessioned 2017-08-30T14:16:21Z
dc.date.available 2017-08-30T14:16:21Z
dc.date.issued 2016
dc.date.submitted 2016
dc.identifier.other b18646244
dc.identifier.uri http://hdl.handle.net/10938/10966
dc.description Thesis. M.E.M. American University of Beirut. Department of Industrial Engineering and Management, 2016. ET:6400
dc.description Advisors : Dr. Walid Nasr, Assistant Professor, Industrial Engineering and Management ; Committee members : Dr. Bacel Maddah, Associate Professor and Chair, Industrial Engineering and Management ; Dr. Hussein Tarhini, Assistant Professor, Industrial Engineering and Management.
dc.description Includes bibliographical references (leaves 100-104)
dc.description.abstract This research proposes the simulation of three arrival processes: phase-type (PH) process-distribution, Markovian arrival process (MAP) and batch Markovian arrival process (BMAP). Two simulation models are developed and utilized to randomly generate inter-arrival times, i.e. the time headway between two successive event occurrences. PHDs, MAPs and BMAPs do not belong to the distributions or stochastic processes that are commonly used in simulation tools, but it is usually straightforward to integrate them into simulation software by drawing on the underlying Markov chains which govern the activity of these processes. Building stochastic simulation models based on the underlying Markov chain becomes extensive and error-prone for processes with higher orders, lagging in both time and traceability. Therefore, an alternative approach to simulating these processes is proposed, such that only the start and end states of an arrival epoch, rather than its whole transition activity, are utilized to set a cumulative distribution for the inter-arrival time. Since the inter-arrival time understudy is a matrix exponential, then the corresponding cumulative distribution function cannot be inverted and the classical inverse transform method cannot be applied. In this context, discretization of the function is an appropriate alternative whereby a database of inter-arrival times and their corresponding cumulative probabilities is formulated and then randomly sampled to generate inter-event times. The scope of work comprises of conducting: (1) the simulation of the underlying Markov chain such that arrivals and their corresponding arrival times are recorded and alternatively (2) the discretization of the cumulative distribution function indicated by the start and end states of arrival epochs and random sampling of the latter to produce random inter-arrival times. Approaches (1) and (2) are applied on several examples and compared in terms of accuracy and efficiency. Results suggest that the approach (2) is capable of performin
dc.format.extent 1 online resource (xiii, 104 leaves) : illustrations (some color)
dc.language.iso eng
dc.relation.ispartof Theses, Dissertations, and Projects
dc.subject.classification ET:006400
dc.subject.lcsh Markov operators.
dc.subject.lcsh Markov processes.
dc.subject.lcsh Renewal theory.
dc.subject.lcsh Correlation (Statistics)
dc.subject.lcsh Simulation methods.
dc.subject.lcsh Queuing theory.
dc.title Generation of random variates for PHDs, MAPs and BMAPs -
dc.type Thesis
dc.contributor.department Faculty of Engineering and Architecture.
dc.contributor.department Department of Industrial Engineering and Management,
dc.contributor.institution American University of Beirut.


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


Browse

My Account