Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm | Journal of Intelligent Manufacturing Skip to main content

Advertisement

Springer Nature Link
Log in

Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Solving the problem of allocating and scheduling quay cranes (QCs) is very important to ensure favorable port service. This work proposes a bi-criteria mixed integer programming model of the continual and dynamic arrival of several vessels at a port. A multi-objective genetic algorithm is applied to solve the problem in three cases. The results thus obtained confirm the feasibility and effectiveness of the model and GA. Additionally, the multi-objective solution considering both the total duration for which vessels stay in the port and QCs move is the best, as determined by comparing with considering only the total time for which vessels stay in the port or QCs move, as it considers, and it balances these two objectives.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Fan, Z., & Le, M. (2013). A genetic algorithm to minimize the makespan and waiting time for the bi-objective quay crane scheduling problem. Journal of Systems & Management, 22(1), 120–127.

  • Gen, M., & Cheng, R. (2000). Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons.

    Google Scholar 

  • Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866.

    Article  Google Scholar 

  • Han, J., Sun, X., & Jin, Z. (2008). Coordinated optimization method for berth and quay crane allocation in container terminal. Journal of Dalian Maritime University, 2, 117–121.

    Google Scholar 

  • Jin, Z., & Li, N. (2011). Optimization of quay crane dynamic scheduling based on berth schedules in container terminals. Journal of Transportation Systems Engineering and Information Technology, 11(3), 58–64.

    Article  Google Scholar 

  • Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156, 752–768.

    Article  Google Scholar 

  • Moghaddam, R. T., Makui, A., Salahi, A., et al. (2009). An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Computers & Industrial Engineering, 56, 241–248.

    Article  Google Scholar 

  • Qin, J., Ni, L., & Wang, C. (2013). Optimization model and algorithm for quay crane scheduling in container terminals. Journal of Southwest Jiao Tong University, 1, 184–192.

    Google Scholar 

  • Tang, S. (2011). Research of optimal allocation for container berth and quay crane resources. MS Dissertation, Dalian Maritime University.

  • Zhang, Y. (2012). Quay crane scheduling problem at container terminal based on operations balance. PhD Dissertation, Shanghai Maritime University.

Download references

Acknowledgments

This research is supported by National Natural Science Foundation of China (71471110, 71301101, 2014M550084), Science and Technology Commission Foundation of Shanghai (09DZ2250400, 9530708200, 10190502500) and Shanghai Education Commission Leading Academic Discipline Project (J50604), Liaoning Social Science Planning Fund Plan (L14CJY041); the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS) No. 245102190001, National Tsing Hua University (NSC 101-2811-E-007-004, NSC 102-2811-E-007-005), and the Dongseo Frontier Project Research Fund of Dongseo University in 2011.

Author information

Authors and Affiliations

  1. Logistics Research Center, Shanghai Maritime University, Shanghai, China

    ChengJi Liang, MiaoMiao Li & Yi Ding

  2. Institute of E-commerce and Modern Logistics, Dalian University, Dalian, China

    Bo Lu

  3. School of Management, UCAS, Beijing, China

    Bo Lu

  4. Shanghai International Port Group Co., Ltd, Shanghai, China

    Tianyi Gu

  5. Division of Computer and Information Engineering, Dongseo University, Busan, South Korea

    Jungbok Jo

Authors
  1. ChengJi Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. MiaoMiao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tianyi Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jungbok Jo
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yi Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Lu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liang, C., Li, M., Lu, B. et al. Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm. J Intell Manuf 28, 847–855 (2017). https://doi.org/10.1007/s10845-015-1035-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1035-7

Keywords

Search

Navigation