Abstract
Berth assignment is the basic problem of the port ship-scheduling. Considering the different importance of different ships, this paper put forward a model for the use of ship resources, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix forms by ontology reasoning. Finally, the model based on improved ant colony algorithm and ontology reasoning is applied to the combination of the dynamic berth assignment problem solving process.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
YuMeng, JiYu-duo (2007) Based on multi-agent container terminal production scheduling. Wuhan University of Technology
LiuJian (2008) Improved virtual enterprise partner selection and integration of genetic algorithm and ant colony algorithm. Beijing University of Aeronautics and Astronautics
Acknowledgement
This research was supported by “the Fundamental Research Funds for the Central Universities” under Grant 2011JBM042. The authors also wish to thank the port in the paper for support in data collection.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, C., Guan, Z., Song, Y. (2013). Research on Dynamic Berth Assignment of Bulk Cargo Port Based on Ant Colony Algorithm. In: Zhang, Z., Zhang, R., Zhang, J. (eds) LISS 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32054-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-32054-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32053-8
Online ISBN: 978-3-642-32054-5
eBook Packages: Business and EconomicsBusiness and Management (R0)