An Optimal Scheduling System for the Welland Canal

E. R. Petersen and A. J. Taylor
Additional contact information
E. R. Petersen: Queen's University, Kingston, Ontario, Canada K7L 3N6
A. J. Taylor: Queen's University, Kingston, Ontario, Canada K7L 3N6

Transportation Science, 1988, vol. 22, issue 3, 173-185

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.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.3.173 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:22:y:1988:i:3:p:173-185

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().