Abstract
PurposeThe purpose of this paper is to propose a rolling horizon procedure (RHP) to deal with the large‐scale and strongly NP‐hard problem on cooperative lockage‐timetables and service‐policies of the five locks in the Three Gorges Project.Design/methodology/approachRHP based approach is composed of a series of periodical short‐time sub‐optimizations instead of global optimization. Each of the sub‐optimizations is modeled by a mixed‐integer‐programming and solved by a branch and bound algorithm with terminal penalty.FindingsThe RHP method is found to be effective and efficient. The size of the rolling horizon is positively correlated to the total weighted area of ships.Research limitations/implicationsPrecision of short‐time predictions is the main limitation.Originality/valueThis procedure promotes the navigation capacity of the Three Gorges Project and proposes a solution to the lockage‐scheduling problem of the Three Gorges Project.
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.
