Skip to main content

Advertisement

SpringerLink
Log in

QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA)

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

As an important part of container logistics, quay cranes (QCs) are crucial equipment in multimodal container transportation. The scheduling and allocation of QCs determine the operational efficiency of container terminals. By analyzing the way quay cranes are operated, this paper establishes a mixed-integer dynamic rolling-horizon programming model for the scheduling and allocation of QCs and proposes use of a genetic algorithm and two improved firefly algorithms based on segment encoding technology to formulate an optimum QC scheduling scheme. In doing so, the improved approach has made QC control more efficient and balanced.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

References

  1. Imai, A., Chen, H.C., Nishimura, E., Papadimitriou, S.: The simultaneous berth and quay crane allocation problem. Transp. Res. E 44(5), 900–920 (2008)

    Article  Google Scholar 

  2. Liang, C., Huang, Y., Yang, Y.: A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Ind. Eng. 56(3), 1021–1028 (2009)

    Article  Google Scholar 

  3. Zhou, P., Kang, H.: Study on berth and quay-crane allocation under stochastic environments in container terminal. Syst. Eng. Theory Practice 28(1), 161–169 (2008)

    Article  MathSciNet  Google Scholar 

  4. Chang, D., Jiang, Z., Yan, W., He, J.: Integrating berth allocation and quay crane assignments. Transp. Res. E 46(6), 975–990 (2010)

    Article  Google Scholar 

  5. 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(3), 1327–1340 (2010)

    Article  MATH  Google Scholar 

  6. Kim, K., Park, Y.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752–768 (2004)

    Article  MATH  Google Scholar 

  7. Moccia, L., Cordeau, J.F., Gaudioso, M., Laporte, G.: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Res. Logist. 53(1), 45–59 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chung, S., Choy, K.: A modified genetic algorithm for quay crane scheduling operations. Expert Syst. Appl. 39(4), 4213–4221 (2012)

    Article  Google Scholar 

  9. Sammarra, M., Cordeau, J.F., Laporte, G., Monaco, M.F.: A tabu search heuristic for the quay crane scheduling problem. J. Sched. 10(4), 327–336 (2007)

    Article  MATH  Google Scholar 

  10. Kaveshgar, N., Huynh, N., Rahimian, S.K.: An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Syst. Appl. 39(18), 13108–13117 (2012)

    Article  Google Scholar 

  11. Lee, D., Wang, H., Miao, L.: Quay crane scheduling with non-interference constraints in port container terminals. Transp. Res. E 44(1), 124–135 (2008)

    Article  Google Scholar 

  12. Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 12(4), 345–360 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen, J.H., Lee, D.H., Goh, M.: An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem. Eur. J. Oper. Res. 232(1), 198–208 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Meisel, F., Bierwirth, C.: A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput. Oper. Res. 38(3), 683–693 (2011)

    Article  Google Scholar 

  15. Legato, P., Trunfio, R., Meisel, F.: Modeling and solving rich quay crane scheduling problems. Comput. Oper. Res. 39(9), 2063–2078 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lu, Z., Han, X., Xi, L., Erera, A.L.: A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Comput. Oper. Res. 39(12), 2915–2928 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Hybrid evolutionary computation methods for quay crane scheduling problems. Comput. Oper. Res. 40(8), 2083–2093 (2013)

    Article  MATH  Google Scholar 

  18. Guan, Y., Yang, K.H., Zhou, Z.: The crane scheduling problem: models and solution approaches. Ann. Oper. Res. 203(1), 119–139 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. Daganzo, C.F.: The crane scheduling problem. Transp. Res. B 23(3), 159–175 (1989)

    Article  MathSciNet  Google Scholar 

  20. Peterkofsky, R.I., Daganzo, C.F.: A branch and bound solution method for the crane scheduling problem. Transp. Res. B 24(3), 159–172 (1990)

    Article  Google Scholar 

  21. Liu, J., Yw, Wan, Wang, L.: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Res. Logist. 53(1), 60–74 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tavakkoli-Moghaddam, R., Makui, A., Salahi, S., Bazzazi, M., Taheri, F.: An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Comput. Ind. Eng. 56(1), 241–248 (2009)

    Article  Google Scholar 

  23. Unsal, O., Oguz, C.: Constraint programming approach to quay crane scheduling problem. Transp. Res. E 59, 108–122 (2013)

    Article  Google Scholar 

  24. Fu, Y.M., Diabat, A., Tsai, I.T.: A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst. Appl. 41(15), 6959–6965 (2014)

    Article  Google Scholar 

  25. Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115–123 (2014)

    Article  Google Scholar 

  26. Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations. Comput. Ind. Eng. 56(3), 979–992 (2009)

    Article  Google Scholar 

  27. Meisel, F., Wichmann, M.: Container sequencing for quay cranes with internal reshu_es. OR Spectr. 32(3), 569–591 (2010)

    Article  MATH  Google Scholar 

  28. Yang, X.S. (2010) Nature-inspired metaheuristic algorithms: Second edition Yu S, Wang S, Zhen L (2016) Quay crane scheduling problem with considering tidal impact and fuel consumption. Flex. Serv. Manuf. J., 1–24

  29. Arunkumar, N., Ramkumar, K., Venkatraman, V., Abdulhay, E., Fernandes, S.L., Kadry, S., Segal, S.: Classification of focal and non focal EEG using entropies. Pattern Recogn. Lett. 94, 112–117 (2017)

    Article  Google Scholar 

  30. Arunkumar, N., Kumar, K.R., Venkataraman, V.: Automatic detection of epileptic seizures using new entropy measures. J. Med. Imaging Health Inform. 6(3), 724–730 (2016)

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported by Shanghai Pujiang Program (15PJ1402900).

Author information

Authors and Affiliations

  1. School of Logistics Engineering, Shanghai Maritime University, Shanghai, 201306, China

    Liangcai Dong & Siyun Sun

  2. Engineering Research Center of Container Supply Chain Technology of Ministry of Education, Shanghai Maritime University, Shanghai, 201306, China

    Yang Yang

Authors
  1. Liangcai Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Siyun Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liangcai Dong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dong, L., Yang, Y. & Sun, S. QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA). Cluster Comput 22 (Suppl 2), 4331–4348 (2019). https://doi.org/10.1007/s10586-018-1873-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-1873-0

Keywords

Search

Navigation