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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
