1 Modeling arrival process 22-05-2012 Challenge the future Delft University of Technology Modeling the arrival process at dry bulk terminals Delft University.

Slides:



Advertisements
Similar presentations
Group 1 Ray Quintero, Lei Tian, Jiayin Liu, Morvarid Amirfathi, Rabeeh Sahranavard, Max Tubbs Production Control & Queuing.
Advertisements

Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
Copyright © 2004, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 5 The Cellular Concept.
Stockyard layout (re)design
CONTAINER TERMINAL FSC Container Terminal FSC Company Presentation December 2010.
Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
Lecture 13 – Continuous-Time Markov Chains
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Queuing Models Basic Concepts
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Queuing and Transportation
Waiting Line Management
Management of Waiting Lines
© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F.
Zakynthos Island, Greece May 23, 2005 Performance Analysis of a Multiple Vehicle Tandem System with Inter-vehicle Buffers and Blocking Matthew E. H. Petering.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
CHAPTER 6 Statistical Analysis of Experimental Data
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
The Poisson process and exponentially distributed service time In real life customers don’t arrive at pre-ordained times as specified in the last tutorial…
Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.
Lecture 4 Mathematical and Statistical Models in Simulation.
Chapter 9: Queuing Models
WAITING LINES The study of waiting lines, called queuing theory, is one of the most widely used and oldest management science techniques. The three basic.
Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.
Location Models For Airline Hubs Behaving as M/D/C Queues By: Shuxing Cheng Yi-Chieh Han Emile White.
Queuing Theory (Waiting Line Models)
McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved. Waiting Line Models.
Copyright warning. COMP5348 Lecture 6: Predicting Performance Adapted with permission from presentations by Alan Fekete.
Capacity analysis of complex materials handling systems.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Probability Review Thinh Nguyen. Probability Theory Review Sample space Bayes’ Rule Independence Expectation Distributions.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Chapter 10. Simulation An Integrated Approach to Improving Quality and Efficiency Daniel B. McLaughlin Julie M. Hays Healthcare Operations Management.
Introduction to Operations Research
18 Management of Waiting Lines.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1 QUEUES. 2 Definition A queue is a linear list in which data can only be inserted at one end, called the rear, and deleted from the other end, called.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Traffic Flow Fundamentals
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
Simulation vs. Queuing Theory
A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites S. Elnikety, E. Nahum, J. Tracey and W. Zwaenpoel Presented By.
Reid & Sanders, Operations Management © Wiley 2002 Simulation Analysis D SUPPLEMENT.
Chapter 3 System Performance and Models Introduction A system is the part of the real world under study. Composed of a set of entities interacting.
CS352 - Introduction to Queuing Theory Rutgers University.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Technical Supplement 2 Waiting Line Models McGraw-Hill/Irwin Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
OPERATING SYSTEMS CS 3502 Fall 2017
WAITING LINES AND SIMULATION
Fundamentals of Cellular Networks (Part IV)
Management of Waiting Lines
B.Ramamurthy Appendix A
CSCI1600: Embedded and Real Time Software
RORO?.
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Queueing Theory 2008.
Presentation transcript:

1 Modeling arrival process Challenge the future Delft University of Technology Modeling the arrival process at dry bulk terminals Delft University of Technology T.A. van Vianen, J.A. Ottjes and G. Lodewijks Faculty 3ME, Transport Engineering & Logistics

2 Modeling arrival process Content Arrival process Average port time Modeling arrival process Continuous quay layout or multiple berths Conclusions

3 Modeling arrival process Arrival process (1) Typical performance indicator is the average ships’ waiting time Agreements between terminal operators and ship-owners are made about the maximum ships’ port time Demurrage costs have to be paid if ships stay longer in the port How much capacity must be installed at the quay side? Ship unloading (Courtesy of J.Hiltermann)Ship loading (Courtesy of Richards Bay Coal Terminal)

4 Modeling arrival process Arrival process (2) How to prevent that ships are queuing before getting serviced? Ships waiting before servicing Quay side capacity Costs Demurrage costs Operational costs Find the optimum

5 Modeling arrival process Content Arrival process Average port time Modeling arrival process Continuous quay layout or multiple berths Conclusions

6 Modeling arrival process Average port time (1) Average port time is the average waiting time plus the average service time Ships’ interarrival time predominately determines the average waiting time Quay crane capacity and carriers’ tonnage determines the average service time Arrival process Waiting Servicing

7 Modeling arrival process Average port time (2) Existing literature about ships’ arrivals: Ships do not generally arrive at their scheduled times because of bad weather conditions, swells and other natural phenomena during the sea journey as well as unexpected failures or stoppages (Jagerman and Altiok, 2003) Uncontrolled ship arrivals results in ship delays (Asperen, 2004) Ships interarrival times best approximated by a Poisson or Erlang-2 arrival process (UNCTAD, 1985) An Erlang-2 distribution can be used to represent the service time distribution (UNCTAD, 1985 and Jagerman and Altiok, 2003)

8 Modeling arrival process Average port time (3) But what is meant with Poisson or Erlang-2 distributed interarrival times? In a Poisson and Erlang-2 arrival process, probability distributions express the probability of a ship arrival in a fixed interval of time Poisson and Erlang-2 distributions for ships’ interarrival times with an average of 10 hours

9 Modeling arrival process Average port time (4) From 3 terminals, the arrival process was investigated to check real-world data with existing literature T1: single-user, import terminal T2: stevedore, import terminal T3: single-user, export terminal Interarrival time distributions T1 ~ Erlang-2 T2  Poisson T3 ~ Normal Interarrival time distribution depends on terminal type

10 Modeling arrival process Average port time (5) Service time relates directly to the carriers’ tonnage Carriers’ tonnage distributions Real-world data does not correspond with the suggested Erlang-2 distribution

11 Modeling arrival process Content Arrival process Average port time Modeling arrival process Continuous quay layout or multiple berths Conclusions

12 Modeling arrival process Modeling arrival process (1) Modeling of the arrival process based on Queuing Theory Basic of a queuing systemLabeling of queuing models M/E2/2: Interarrival times distributed according a Poisson (Markovian) arrival process Service times distributed according Erlang-2 distribution 2 servers  2 berths where each berth is equipped with 1 quay crane

13 Modeling arrival process Modeling arrival process (2) For single berth queuing systems, the impact of the several interarrival times distribution was investigated Average waiting time, expressed in average service time, versus quay occupancy for single berths D/E2/1: Single berth queuing system M/E2/1: E2/E2/1:

14 Modeling arrival process Modeling arrival process (3) For multiple berths queuing systems, there are hardly mathematical expressions M/M/s: Multiple berths queuing system E2/E2/s: …….. Graphs of UNCTAD can be used, but what if the service time cannot be represented with an analytical distribution? Research had shown that the unloading capacity is not constant during the entire ship unloading

15 Modeling arrival process Modeling arrival process (4) A discrete-event simulation model was developed CraneClass.Process MyDistGen.Start(Tnow) While True do Begin If IsInQueue(CraneIdleQ) then MyDistGen.Pause While IsInQueue(CraneIdleQ) do standby; If MyDistGen.Status = interrupted then MyDistGen.Resume(Tnow); If MyShip <>nil then Begin if MyShip.Tons > 0 then Begin MyShip.Tons:=MyShip.Tons – GrabTons; Hold(Cranecycle); end; if MyShip.Tons = 0 then Begin If (IsInQueue(MyBerth.MyCranesQ)) and (MyBerth.MyCranesQ.Length > 1) then Begin LeaveQueue(MyBerth.MyCranesQ); LeaveQueue(CraneActiveQ); End; if (IsInQueue(MyBerth.MyCranesQ)) and (MyBerth.MyCranesQ.Length = 1) then Begin LeaveQueue(MyBerth.MyCranesQ); LeaveQueue(CraneActiveQ); MyBerth.MyShip.Destroy; MyBerth.LeaveQueue(BerthOccupiedQ); MyBerth.EnterQueue(DeberthQ); end; EnterQueue(CraneIdleQ); end; End;

16 Modeling arrival process Modeling arrival process (5) For multiple berths queuing systems, the simulation model was used to determine the average ships’ waiting time

17 Modeling arrival process Modeling arrival process (6) For multiple berths queuing systems, the simulation model was used to determine the average ships’ waiting time (M/E2/1: 1.75, M/E2/2: 0.75, M/E2/3: 0.58, M/E2/4: 0.28) Average waiting time, expressed in average service time, versus quay occupancy for multiple berths Multiple berths queuing system

18 Modeling arrival process Modeling arrival process (7) Can analytical models be used for an accurate arrival process modeling? The simulation model was used to compare terminals’ real-world arrival data with analytical models * 5% of all bulk carriers were generated with tonnages between 0 tons and 25,000 tons. Table distribution to represent carriers’ tonnage for T2 Comparison real-world data with analytical models

19 Modeling arrival process Content Arrival process Average port time Modeling arrival process Continuous quay layout or multiple berths Conclusions

20 Modeling arrival process Continuous quay layout or multiple berths (1) A)Continuous quay layout B)Multiple berths operation Interarrival time distribution typeNED Bulk carriers tonnage distributionTable Input Number of quay cranes [-]4 Max. number of ships at the quay [-]4 Quay crane capacity (free-digging)3,000 [t/h] Annual throughput [Mt]20 – 50 Runtime of simulation [years]5 Simulation input

21 Modeling arrival process Continuous quay layout or multiple berths (2) Occupied quay length versus annual throughput

22 Modeling arrival process Conclusions Serving ships on time and at correct speed is crucial for terminal operators Modeling the ships’ arrival process is required to design the terminal’s quay side The ‘wilder’ the arrival pattern, the greater the average waiting time Modeling the arrival process must be based on Queuing Theory However, for multiple berths there are hardly analytical solutions and a discrete-event simulation is proposed For an accurate modeling, it is proposed to use a table distribution which represents the carriers’ tonnage instead of using analytical models for the service time distribution A continuous quay operation results in a higher annual throughput or less required quay length

23 Modeling arrival process Thank you!