IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i3p173-185.html
   My bibliography  Save this article

An Optimal Scheduling System for the Welland Canal

Author

Listed:
  • E. R. Petersen

    (Queen's University, Kingston, Ontario, Canada K7L 3N6)

  • A. J. Taylor

    (Queen's University, Kingston, Ontario, Canada K7L 3N6)

Abstract

The problem of real time scheduling of vessels through the Welland Canal is discussed. A mathematical programming scheduling algorithm is presented. The problem is formulated as a master schedule selection problem and a schedule evaluation subproblem. The schedule evaluation subproblem is a linear programming model, which, due to special structure, can be solved using an efficient dynamic programming algorithm. The schedule selection algorithm is a heuristic that employs optimal dynamic programming submodels for scheduling the individual locks. Sensitivity information from the schedule evaluation model is used in a greedy type of algorithm to fine tune the schedule. An example of a schedule for the Welland Canal is presented.

Suggested Citation

  • E. R. Petersen & A. J. Taylor, 1988. "An Optimal Scheduling System for the Welland Canal," Transportation Science, INFORMS, vol. 22(3), pages 173-185, August.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:3:p:173-185
    DOI: 10.1287/trsc.22.3.173
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.3.173
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.22.3.173?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
    ---><---

    Citations

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


    Cited by:

    1. Elio Canestrelli & Marco Corazza & Giuseppe Nadai & Raffaele Pesenti, 2017. "Managing the Ship Movements in the Port of Venice," Networks and Spatial Economics, Springer, vol. 17(3), pages 861-887, September.
    2. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    3. Özgecan Ulusçu & Tayfur Altiok, 2013. "Waiting time approximation in multi-class queueing systems with multiple types of class-dependent interruptions," Annals of Operations Research, Springer, vol. 202(1), pages 185-195, January.
    4. Shuai Jia & Chung-Lun Li & Zhou Xu, 2019. "Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port," Transportation Science, INFORMS, vol. 53(3), pages 728-745, May.
    5. 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.
    6. 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.
    7. 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.
    8. 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).
    9. 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.
    10. Özgecan Ulusçu & Tayfur Altıok, 2009. "Waiting time approximation in single-class queueing systems with multiple types of interruptions: modeling congestion at waterways entrances," Annals of Operations Research, Springer, vol. 172(1), pages 291-313, November.
    11. 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.
    12. 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.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ortrsc:v:22:y:1988:i:3:p:173-185. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.