Abstract

In recent years, the demand for dry bulk cargo trade has increased, and the scheduling pressure on bulk cargo ports is increasing daily. The most effective and cost-effective way to alleviate the pressure of port scheduling management rapidly is to optimize the overall scheduling of different port resources. Channel vessel scheduling and berth–yard loading and unloading operations are usually regarded as independent operations; however, plans that meet the needs of comprehensive port management can only be effectively developed through the integrated scheduling of multiple resources. Therefore, from the perspective of overall port management and operation, considering practical factors in scheduling, this article construct a multiobjective optimization model for the overall scheduling of restricted channels, berths, and yards in bulk cargo ports. Based on actual allocation principles, corresponding allocation algorithms for storage yards and stacker–reclaimer machines are designed, and these algorithms are combined with a multiobjective genetic algorithm to construct the NSGA-II-DPGR algorithm for model calculation. Results show that the proposed model and algorithm can provide vessel scheduling and cargo loading and unloading plans. This article experimentally verify the rationality of the results, the superiority of the strategy compared to the traditional first-come, first-serve strategy, and the feasibility of combining the proposed model and algorithm with onshore scheduling in the future.

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

Disclaimer: 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.