IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i4d10.1057_palgrave.jors.2602587.html
   My bibliography  Save this article

Simulation of alternative approaches to relieving congestion at locks in a river transportion system

Author

Listed:
  • L D Smith

    (University of Missouri-St Louis, One University Blvd.)

  • D C Sweeney

    (University of Missouri-St Louis, One University Blvd.)

  • J F Campbell

    (University of Missouri-St Louis, One University Blvd.)

Abstract

We construct a discrete-event simulation model to investigate the impact of alternative decision rules and infrastructural improvements to relieve traffic congestion in a section of the Upper Mississippi River navigation system. The model covers a series of five locks that serve commercial tows with widely different barge configurations, as well as private recreational vessels. Mixes and intensities of vessel activity are highly dependent on the time of year, day of week and time of day. The model reveals that some improvement in performance (especially in peak periods) can be achieved by scheduling lock activity with priority given to vessels with shortest average processing and lock set-up times (tempered by the time that vessels have spent in queue). Greater improvement occurs with the use of helper boats and greatest improvement occurs with enlarged locks. The alternative remedies must be evaluated with consideration of their dramatically different capital costs.

Suggested Citation

  • L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
  • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602587
    DOI: 10.1057/palgrave.jors.2602587
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602587
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2602587?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xuanming Su & Stefanos Zenios, 2004. "Patient Choice in Kidney Allocation: The Role of the Queueing Discipline," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 280-301, June.
    2. Poon, M. H. & Wong, S. C. & Tong, C. O., 2004. "A dynamic schedule-based model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 343-368, May.
    3. Dai, Melody D. M. & Schonfeld, Paul, 1998. "Metamodels for estimating waterway delays through series of queues," Transportation Research Part B: Methodological, Elsevier, vol. 32(1), pages 1-19, January.
    4. Jiang, Yi & Li, Shuo & Shamo, Daniel E., 2006. "A platoon-based traffic signal timing algorithm for major-minor intersection types," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 543-562, August.
    5. M. C. van der Heijden & A. van Harten & M. J. R. Ebben & Y. A. Saanen & E. C. Valentin & A. Verbraeck, 2002. "Using Simulation to Design an Automated Underground System for Transporting Freight Around Schiphol Airport," Interfaces, INFORMS, vol. 32(4), pages 1-19, August.
    6. Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    7. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    8. Ebben, Mark & van der Zee, Durk-Jouke & van der Heijden, Matthieu, 2004. "Dynamic one-way traffic control in automated transportation systems," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 441-458, June.
    9. M R Phillips & D T Marsh, 2000. "The validation of fast-time air traffic simulations in practice," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(4), pages 457-464, April.
    10. Norman H. Jennings & Justin H. Dickins, 1958. "Computer Simulation of Peak Hour Operations in a Bus Terminal," Management Science, INFORMS, vol. 5(1), pages 106-120, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Passchyn, Ward & Briskorn, Dirk & Spieksma, Frits C.R., 2016. "Mathematical programming models for lock scheduling with an emission objective," European Journal of Operational Research, Elsevier, vol. 248(3), pages 802-814.
    2. Di Zhang & Xinping Yan & Zaili Yang & Jin Wang, 2014. "An accident data–based approach for congestion risk assessment of inland waterways: A Yangtze River case," Journal of Risk and Reliability, , vol. 228(2), pages 176-188, April.
    3. Ji, Bin & Zhang, Dezhi & Yu, Samson S. & Zhang, Binqiao, 2021. "Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective," European Journal of Operational Research, Elsevier, vol. 288(1), pages 47-62.
    4. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    5. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    6. Buchem, Moritz & Golak, Julian Arthur Pawel & Grigoriev, Alexander, 2022. "Vessel velocity decisions in inland waterway transportation under uncertainty," European Journal of Operational Research, Elsevier, vol. 296(2), pages 669-678.
    7. Verstichel, J. & De Causmaecker, P. & Spieksma, F.C.R. & Vanden Berghe, G., 2014. "Exact and heuristic methods for placing ships in locks," European Journal of Operational Research, Elsevier, vol. 235(2), pages 387-398.
    8. Ward Passchyn & Frits C. R. Spieksma, 2019. "Scheduling parallel batching machines in a sequence," Journal of Scheduling, Springer, vol. 22(3), pages 335-357, June.
    9. Caris, An & Limbourg, Sabine & Macharis, Cathy & van Lier, Tom & Cools, Mario, 2014. "Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges," Journal of Transport Geography, Elsevier, vol. 41(C), pages 126-136.
    10. T. Edward Yu & Bijay P. Sharma & Burton C. English, 2019. "Investigating Lock Delay on the Upper Mississippi River: a Spatial Panel Analysis," Networks and Spatial Economics, Springer, vol. 19(1), pages 275-291, March.
    11. Deng, Yao & Sheng, Dian & Liu, Baoli, 2021. "Managing ship lock congestion in an inland waterway: A bottleneck model with a service time window," Transport Policy, Elsevier, vol. 112(C), pages 142-161.
    12. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    13. Golak, Julian Arthur Pawel & Defryn, Christof & Grigoriev, Alexander, 2022. "Optimizing fuel consumption on inland waterway networks: Local search heuristic for lock scheduling," Omega, Elsevier, vol. 109(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhao, Chen & Wang, Zhongbin, 2023. "The impact of line-sitting on a two-server queueing system," European Journal of Operational Research, Elsevier, vol. 308(2), pages 782-800.
    2. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    3. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    4. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    5. Ji, Bin & Zhang, Dezhi & Yu, Samson S. & Zhang, Binqiao, 2021. "Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective," European Journal of Operational Research, Elsevier, vol. 288(1), pages 47-62.
    6. Rey, David & Levin, Michael W. & Dixit, Vinayak V., 2021. "Online incentive-compatible mechanisms for traffic intersection auctions," European Journal of Operational Research, Elsevier, vol. 293(1), pages 229-247.
    7. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    8. Caris, An & Limbourg, Sabine & Macharis, Cathy & van Lier, Tom & Cools, Mario, 2014. "Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges," Journal of Transport Geography, Elsevier, vol. 41(C), pages 126-136.
    9. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    10. Ji, Bin & Zhang, Dezhi & Zhang, Zheng & Yu, Samson S. & Van Woensel, Tom, 2022. "The generalized serial-lock scheduling problem on inland waterway: A novel decomposition-based solution framework and efficient heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    11. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    12. Sheng Zhu & Jinting Wang & Bin Liu, 2020. "Equilibrium joining strategies in the Mn/G/1 queue with server breakdowns and repairs," Operational Research, Springer, vol. 20(4), pages 2163-2187, December.
    13. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    14. Balachandran, Kashi R. & Radhakrishnan, Suresh, 1996. "Cost of congestion, operational efficiency and management accounting," European Journal of Operational Research, Elsevier, vol. 89(2), pages 237-245, March.
    15. Jalili Marand, Ata & Hoseinpour, Pooya, 2024. "A congested facility location problem with strategic customers," European Journal of Operational Research, Elsevier, vol. 318(2), pages 442-456.
    16. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    17. Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
    18. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    19. Fajardo, Val Andrei & Drekic, Steve, 2015. "Controlling the workload of M/G/1 queues via the q-policy," European Journal of Operational Research, Elsevier, vol. 243(2), pages 607-617.
    20. Platz, Trine Tornøe & Østerdal, Lars Peter, 2017. "The curse of the first-in–first-out queue discipline," Games and Economic Behavior, Elsevier, vol. 104(C), pages 165-176.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602587. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.