Skip to main content
Log in

The improved AFSA algorithm for the berth allocation and quay crane assignment problem

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In the practical situation, the QC setup time cannot be negligible in the decision making process due to the QC speed limitations of shifting along the quay. This paper established the deterministic model of the berth allocation and quay crane assignment problem considered the QC setup time of shifting along the quay. This paper proposed the artificial fish swarm algorithm (AFSA) with the heuristic adjusted strategies to optimize the priority list of vessels served and allocate the QC numbers. The experiment results show the improved AFSA algorithm has more efficiency and competitive quality of solution than the CPLEX.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Park, Y.M., Kim, K.H.: A scheduling method for berth and quay cranes. OR Spectr. Quant. Approaches Manag. 25, 1–23 (2003)

    Google Scholar 

  2. Imai, A., Nishimura, E., Papadimitriou, S., et al.: The simultaneous berth and quay crane allocation problem. Transp. Res. Part E 44, 900–920 (2008)

    Google Scholar 

  3. Meisel, F., Bierwirth, C.: Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. Part E Logist. Transp. Rev. 45, 196–209 (2009)

    Google Scholar 

  4. Lee, D.H., Wang, H.Q.: Integrated discrete berth allocation and quay crane scheduling in port container terminals. Eng. Optim. 42, 747–761 (2010)

    Google Scholar 

  5. Yang, C.X., Wang, X.J., Li, Z.F.: An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Comput. Ind. Eng. 63, 243–253 (2012)

    Google Scholar 

  6. Liang, X.L, Li, W.F., Zhao, W., et al.: Multistage collaborative scheduling of berth and quay crane based on heuristic strategies and particle swarm optimistic algorithm. In: 2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design, China, pp. 913–918 (2012)

  7. Turkogullari, Y.B., Taskin, Z.C., Aras, N., Altinel, I.K.: Optimal berth allocation and time-invariant quay crane assignment in container terminals. Eur. J. Oper. Res. 235, 88–101 (2014)

    Google Scholar 

  8. Iris, C., Pacino, D., Ropke, S., Larsen, A.: Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results. Transp. Res. Part E 81, 75–97 (2015)

    Google Scholar 

  9. Li, X.L.: A new intelligent optimization algorithm: artificial fish school algorithm. Zhejiang University, Hang Zhou (2003)

    Google Scholar 

  10. Liu, Y.: Improved artificial fish swarm algorithm for vehicle routing problem with backhaul and fuzzy demand. Patt. Recog. Artif. Intell. 23, 560–564 (2010)

    Google Scholar 

  11. Han, X., Lu, Z., Xi, L.: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur. J. Oper. Res. 207, 1327–1340 (2010)

    Google Scholar 

  12. Zhang, Z.Y., Lu, Z., Han, X.L.: Robust integrated scheduling for berth and quay crane based on proactive-reactive method. Comput. Integr. Manuf. Syst. 20, 1181–1190 (2014)

    Google Scholar 

Download references

Acknowledgements

This study was supported by the Zhejiang Provincial Natural Science Foundation of China (Foundation No. LY14G010006).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Y., Wang, J. & Shahbazzade, S. The improved AFSA algorithm for the berth allocation and quay crane assignment problem. Cluster Comput 22 (Suppl 2), 3665–3672 (2019). https://doi.org/10.1007/s10586-018-2216-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-2216-x

Keywords

Navigation