Abstract
The systematic solutions to a berth allocation problem (BAP) at container terminals have been scarce owing to their high complexity and strong randomness. This paper extends the past research on modeling of container terminal logistics systems (CTLS) with computational thinking. We introduce and integrate the task scheduling architecture and mechanism in real-time operating system (RTOS) into BAP, and propose a partition berth allocation scheduler based on resource utilization and load balancing. Subsequently, we establish the fundamental principles of scheduler with the computing perspective and decision framework of ARINC 653, which is a design philosophy of RTOS for integrated modular avionics. Finally, the approach is demonstrated by investigating the stress testing of a typical container terminal logistics service case in contrast with the average random berth assignment algorithm based on the comprehensive computational experiments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615–627 (2010)
Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244(3), 675–689 (2015)
Imai, A., Yamakawaa, Y., Huang, K.: The strategic berth template problem. Transp. Res. Part E: Log. Transp. Rev. 72, 77–100 (2014)
Jin, J.G., Lee, D.H., Hu, H.: Tactical berth and yard template design at container transshipment terminals: a column generation based approach. Transp. Res. Part E Log. Transp. Rev. 73, 168–184 (2015)
Lalla-Ruiz, E., González-Velarde, J.L., Melián-Batista, B., Moreno-Vega, J.M.: Biased random key genetic algorithm for the tactical berth allocation problem. Appl. Soft Comput. 22, 60–76 (2014)
Zhen, L.: Tactical berth allocation under uncertainty. Eur. J. Oper. Res. 247(3), 928–944 (2015)
Legato, P., Mazza, R.M., Gulli, D.: Integrating tactical and operational berth allocation decisions via simulation–optimization. Comput. Ind. Eng. 78, 84–94 (2014)
Wang, S.A., Liu, Z.Y., Qu, X.B.: Collaborative mechanisms for berth allocation. Adv. Eng. Inf. 29(3), 332–338 (2015)
Li, B.: Container terminal logistics scheduling and decision-making within the conceptual framework of computational thinking. In: Proceedings of the IEEE 54th Annual Conference on Decision and Control (CDC), pp. 330–337 (2015)
Wang, N., Xu, L.J., Song, N.Q., Xu, T.: Distribution function and empirical study of container liner’s arrival discipline. J. Dalian Marit. Univ. 39(4), 107–110 (2013)
Acknowledgments
This work was partially supported by the National Natural Science Foundation of China Grant No. 61304210 and 71372202, and the Program for New Century Excellent Talents in the University of Fujian Province, China(No. 2015-54).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Li, B., Zhang, Y., Liang, X., Yang, L. (2016). A Partition Berth Allocation Scheduler Based on Resource Utilization and Load Balancing. In: Li, W., et al. Internet and Distributed Computing Systems. IDCS 2016. Lecture Notes in Computer Science(), vol 9864. Springer, Cham. https://doi.org/10.1007/978-3-319-45940-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-45940-0_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45939-4
Online ISBN: 978-3-319-45940-0
eBook Packages: Computer ScienceComputer Science (R0)