Vessel Sequencing In The Presence Of A Queue Center For Transportation Studies University Of Missouri, St. Louis June 15, 2005.

Slides:



Advertisements
Similar presentations
Chapter 5: CPU Scheduling
Advertisements

Slide 1 Insert your own content. Slide 2 Insert your own content.
Part 3 Probabilistic Decision Models
© 2004 Dominion Dominion Proposal January 24, 2005.
Lottery Method in BPA’s Simultaneous Submission Windows and Potential Application to the Simultaneous Defender Matching Process NAESB Meeting 05/01/13.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
solved problems on optimization
Tradable Priority Permits Prof. Charles R. Plott Dr. Joseph P. Cook.
Congestion at Locks on Inland Waterways: An Experimental Testbed of a Policy of Tradable Priority Permits for Lock Access Joseph P. Cook, NERA Charles.
CTS Waterways Research Wrap Up Center for Transportation Studies University of Missouri, St. Louis.
1 Waterways Research Inland Waterway Lock/Vessel Optimization Study Upper Mississippi River Locks Center For Transportation Studies University Of.
Inland Waterway Lock/Vessel Optimization Study Upper Mississippi River Locks Center For Transportation Studies University Of Missouri, St. Louis.
UMR Statistical Analysis Inland Navigation Appointment System Study Upper Mississippi River Locks Center For Transportation Studies University Of.
1 Upper Mississippi River - Illinois Waterway System Navigation Study Mississippi Valley Division.
Office of Traffic, Security, and Technology Guide Sign Design June 18-19, 2013 Arden Hills, MN.
You will need some paper!
0 - 0.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
Teacher Name Class / Subject Date A:B: Write an answer here #1 Write your question Here C:D: Write an answer here.
Addition Facts
Exemplar Question One The weight of individual guavas is normally distributed with a mean of 215 g with a standard deviation of 13.2 g. A.
CHARLES N. GLOVER MICHAEL O. BALL DAVID J. LOVELL Collaborative Approaches to the Application of Enroute Traffic Flow Management Optimization Models.
1 How to Enter Time. 2 Select: Log In Once logged in, Select: Employees.
Netique InfoTech (P) Ltd. Welcomes you for the Presentation of Netique Deckle Matcher.
Introduction Queuing is the study of waiting lines, or queues.
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Distributed Scheduling.
Creating a Distribution List using Outlook 2007 Similar to each schools list-serve except that YOU are in control.
Capacity Planning Chapter 14.
Capacity Studies on Transportation Network Presented by Rakesh Ambre ( ) Under Guidance Of Prof. Narayan Rangaraj.
Operations Management
1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri.
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
Created by Susan Neal $100 Fractions Addition Fractions Subtraction Fractions Multiplication Fractions Division General $200 $300 $400 $500 $100 $200.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
pH pH scale- measure of H+ ions (acidity); “power of hydrogen” #10.
Addition 1’s to 20.
Introduction to Queuing Theory
Test B, 100 Subtraction Facts
Chapter 15: Quantitatve Methods in Health Care Management Yasar A. Ozcan 1 Chapter 15. Simulation.
FIND THE AREA ( ROUND TO THE NEAREST TENTHS) 2.7 in 15 in in.
Ye shanshan Friday, May 11, /20.  Problem  Literature Review  Mathematical Model  Conclusion  My idea 参考文献: Gupta, S., and Dutta, K., Modeling.
1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin.
MARITIME TRANSPORTATION MANAGEMENT
Buffered Data Processing Procedure Version of Comments MG / CCSDS Fall Meeting 2012 Recap on Previous Discussions Queue overflow processing.
1Chapter 9-4e Chapter 9. Volume Studies & Characteristics Understand that measured volumes may not be true demands if not careful in data collection and.
Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Belleville Locks & Dam Barge Accident on 6 Jan 05 John Clarkson
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
Route Planning and Evaluation
WMS systems manage and coordinate several independent subtasks. The coordination problems get even more serious when the subtasks are performed on separate.
1 Chapter 16 Applications of Queuing Theory Prepared by: Ashraf Soliman Abuhamad Supervisor by : Dr. Sana’a Wafa Al-Sayegh University of Palestine Faculty.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Data Link Layer We have now discussed the prevalent shared channel technologies  Ethernet/IEEE  Wireless LANs (802.11) We have now covered chapters.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Generalized Model of Lockage Delay Based on Historic Data Michael R. Hilliard, Ph.D. Center for Transportation Analysis Oak Ridge National Laboratory Smart.
1 FIT1005 Topic 6 - Data Link Layer Reference: Chapter 7 -Stallings.
Doc.:IEEE /0313r1 Submission Robert Stacey (Intel) March 12, 2010 Slide 1 Rekeying Protocol Fix Authors: Date:
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
1 Fraunhofer Institute, Dortmund, Germany, May 16, 2008 Analytical Modeling for Inland Waterway Traffic Management and Infrastructure: Experience from.
TCP Selective Acknowledgement Options
Case Study 4 New York State Alternate Route 7 Problem 4
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Kevin Lee & Adam Piechowicz 10/10/2009
Crossing the River.
Error Checking continued
Presentation transcript:

Vessel Sequencing In The Presence Of A Queue Center For Transportation Studies University Of Missouri, St. Louis June 15, 2005

2 Traffic Management Alternatives 1.Existing conditions: first come, first served with exceptions 2.Schedule appointments at locks Using currently available information Using additonal information (e.g. vessel tracking) 3.Re-sequence vessels in local lock queues 4.Re-sequence vessels in extended lock queues Using currently available information Using additonal information (e.g. vessel tracking) 5.Re-sequence vessels in multiple lock queues Using currently available information Using additonal information (e.g. vessel tracking) 6.System-wide traffic management using vessel tracking

3 Lockage Queues Causes Dangerous conditions -Fog -High water -Fast currents Accidents Breakdown/malfunction of a lock High demand

4 Queue Situation Responses Given a set of vessels in queue at a given lock, in what order should the lockmaster clear the queue? Currently a first come, first served protocol is used and occasionally modified by an N up/M down ordering. What is the objective? Clear the queue ASAP according to some measure: -Time required to clear the queue or a weighted measure of total vessel delay times. -Possibly subject to a constraint on limiting the amount of time any particular vessel must wait in excess of a first come, first served processing time.

5 Factors Affecting Lockage Times Upstream/downstream direction. Single cut/double cut, jackknife, etc. Experience and size of crew. Use of motorized winches for recombining a double cut after lockage, helper boats. Turnback/exchange set up times. River Conditions (e.g. water levels, current, etc).

6 Reordering Of Vessels in a Queue (Case 1) If all vessel combinations are of equal importance (tows with 1 barge are the same as tows with 15 barges), then we define the weightings of all vessels to be equal. To minimize total waiting time of queued vessels we reorder the vessels on each side of the lock by the estimated shortest processing time (factors include upstream/downstream status, single cut/double cut, experience of crew, motorized winches, etc.) Generally, this would mean single cuts are processed before double cuts, because they take less time to complete lockage.

7 Determining The Processing Order Through The Lock Once the vessels are ranked using the weighting protocol, we determine the best lockage sequence considering the time required for a turnback or an exchange, and the upstream or downstream status of the previous vessel sent through the lock. After the reordering is completed, we then use an enumeration scheme to determine the up and down sequencing by considering the time required for a turnback or an exchange, and the upstream or downstream status of the previous vessel sent through the lock. (Optional) one might also require than no vessel be delayed more than D hours over and above a first come, first served sequencing through the lock.

8 Reordering Of vessels In Presence Of A Queue (Case 2) If all vessels are NOT of the same importance (tows with 1 barge are the different from tows with 15 barges), then we define the weightings to be different in general. In such a case, we reorder vessels on each side of the lock by increasing values of (estimated lockage time/weight)

9 Reordering Of vessels In Presence Of A Queue (Case 2) (Continued) Generally such an ordering would mean that double cuts with smaller estimated lockage times would be processed before double cuts with larger estimated lockage times and before single cuts (of a lower weighting).

10 Example Assume weights are equal to the number of barges and the 3 vessels are on the same side of the lock -15 barges with 105 minute lockage time -15 barges with 90 minute lockage time - 3 barges with 45 minute lockage time Then barges would be ordered by increasing value of lockage time/weight: -90/15=6 min./Barge -105/15=7min./Barge -45/3=15 min/barge

11 Determine Processing Order Under A Weighting Protocol Once the vessels are ranked using the weighting protocol, we determine the best lockage sequence considering the time required for a turnback or an exchange, and the upstream or downstream status of the previous vessel sent through the lock. We are minimizing the weighted queue time over all possible orderings. (Optional) one might also require that no vessel be delayed more than D hours over and above a first come, first served sequencing through the lock.

12 Consideration Of Tie-ups As A Queue Forms Specify the nearest tie-up location on each side of a lock as a buffer staging area for the next vessel through the lock from that side. If a vessel is initially tied-up in that location at the commencement of a queue situation, then it may be necessary to send that vessel through first, even though the weighting protocol shows a different processing order.

13 Extended Queues Vessels enroute to a lock where a queue exists may be included in the complete enumeration as long as their estimated time of arrival at a lock is earlier than the estimated time of the first possible lockage of a vessel of similar characteristics. (The proposed vessel tracking system may be helpful in such a determination.)

14 Sequencing Vessels Systemically Through Multiple Locks Such sequencing would appear to be problematic due to different upstream/downstream queuing situations at contiguous locks. Another consideration is the appearance of additional vessels commencing travel in a given pool. However, one can use the queue status (of adjacent locks) to determine initial order of vessels through the current lock.