Abstract
To improve the efficiency of in-wharf vessels and out-wharf vessels in seaports, taking into account the characteristics of vessel speeds that are not fixed, a vessel scheduling method with whole voyage constraints is proposed. Based on multi-time constraints, the concept of a minimum safety time interval (MSTI) is clarified to make the mathematical formula more compact and easier to understand. Combining the time window concept, a calculation method for the navigable time window constrained by tidal height and drafts for vessels is proposed. In addition, the nonlinear global constraint problem is converted into a linear problem discretely. With the minimum average waiting time as the goal, the genetic algorithm (GA) is designed to optimize the reformulated vessel scheduling problem (VSP). The scheduling methods under different priorities, such as the first-in-first-out principle, the largest-draft-vessel-first-service principle, and the random service principle are compared and analyzed experimentally with the simulation data. The results indicate that the reformulated and simplified VSP model has a smaller relative error compared with the general priority scheduling rules and is versatile, can effectively improve the efficiency of vessel optimization scheduling, and can ensure traffic safety.
Highlights
Received: 21 July 2021Accepted: 12 August 2021Published: 14 August 2021Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.Licensee MDPI, Basel, Switzerland.The port management department manages the entry and exit operations of most ships through a service with a fixed timetable
Since the time decision variable has a serious impact on optimization efficiency, an upper limit is set for the time at the end of a channel shown as Constraint (21), where θ is greater than 1
The proposed vessel scheduling problem (VSP) model was simplified by introducing the concept of Minimum safety time interval (MSTI), which integrated the multiple time constraints of the model and reduced the complexity of understanding
Summary
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. An works focus on heuristic and mathematical models to optimize theutilized navigation exhaustive search J. algorithm for an theexhaustive optimal scheduling at inland for waterways subject to tidal plan. Considering the effect of traffic conflicts in the Huanghua coal port where multi-harbor basins share a restricted channel, Li, J. et al [21] developed a heuristic algorithm to tackle the mode by integrating the non-dominated sorting genetic algorithm. The current vessel sequence arrangement operations ignore variables in realistic situations such as the sailing speed through the channel, equipment failures, and other unforeseen events The major objective of this study is to tackle the vessel scheduling optimization problem based on variable speed in a one-way navigation channel.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
