Skip to main content

Application of BFO Based on Path Interaction in Yard Truck Scheduling and Storage Allocation Problem

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 952))

  • 837 Accesses

Abstract

Nowadays, Yard Truck Scheduling (YTS) and Storage Allocation Problem (SAP) are still two main problems in container terminal operations. Based on the current situation of using double trailer and practical constricts (e.g. container sorting storage, shore bridge and field bridge processing time), this paper proposes a realistic YTS-SAP model (YTSSAP). Additionally, a path interaction bacterial foraging optimization algorithm (PIBFO) is applied to solve the YTSSAP according to the differential tumbling label method and path interaction strategy. In the two strategies, each individual is given a label. If an individual has been employed as one individual’s interaction object, it will not be selected by the other bacteria. The population is easy to find the optimal solution using the path interaction strategy. The experiment results illustrate that PIBFO performs superior in dealing with the YTSSAP compared with coevolutionary structure-redesigned-based BFO (CSRBFO), comprehensive learning particle swarm optimizer (CLPSO) and genetic algorithm (GA). CLPSO obtains the worst results in terms of the performance and convergence rate when using it to solve the YTSSAP.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Stahlbock, R., VoB, S.: Operations research at container terminals: a literature update. OR Spectr. 30, 1–52 (2008)

    Article  MathSciNet  Google Scholar 

  2. Steenken, D., Voß, S., Stahlbock, R.: Container terminal operation and operations research - a classification and literature review. OR Spectr. 26(1), 3–49 (2004)

    Article  Google Scholar 

  3. Carlo, H.J., Vis, I.F.A., Roodbergen, K.J.: Transport operations in container terminals: literature overview, trends, research directions and classification scheme. Eur. J. Oper. Res. 236(1), 1–13 (2014)

    Article  Google Scholar 

  4. Ma, H.L., Chan, F.T.S., Chung, S.H., Niu, B.: Minimizing port staying time for container terminal with position based handling time. In: 2013 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1339–1343, Bangkok, Thailand (2014)

    Google Scholar 

  5. Emde, S., Boysen, N.: Berth allocation in container terminals that service feeder ships and deep-sea vessels. J. Oper. Res. Soc. 67(4), 551–563 (2016)

    Article  Google Scholar 

  6. Niu, B., Xie, T., Tan, L., Bi, Y., Wang, Z.: Swarm intelligence algorithms for yard truck scheduling and storage allocation problems. Neurocomputing 188, 284–293 (2016)

    Article  Google Scholar 

  7. Al-Dhaheri, N., Jebali, A., Diabat, A.: A simulation-based genetic algorithm approach for the quay crane scheduling under uncertainty. Simul. Model. Pract. Theory 66, 122–138 (2016)

    Article  Google Scholar 

  8. Gao, X.M., Yang, Y., Wu, Z.H.: Genetic algorithm for scheduling double different size crane system with different truck ready times. In: 2016 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 447–451, Tehran, Iran (2016)

    Google Scholar 

  9. Zhang, F., Li, L., Liu, J., Chu, X.: Artificial Bee colony optimization for yard truck scheduling and storage allocation problem. In: Huang, D.-S., Jo, K.-H. (eds.) ICIC 2016. LNCS, vol. 9772, pp. 908–917. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42294-7_81

    Chapter  Google Scholar 

  10. Nanda, J., Mishra, S., Saikia, L.C.: Maiden application of bacterial foraging-based optimization technique in multiarea automatic generation control. IEEE Trans. Power Syst. 24(2), 602–609 (2009)

    Article  Google Scholar 

  11. Chen, Y.P., Li, Y., Wang, G., Zheng, Y.F., Xu, Q., Fan, J.H., et al.: A novel bacterial foraging optimization algorithm for feature selection. Expert Syst. Appl. Int. J. 83, 1–17 (2017)

    Article  Google Scholar 

  12. Panda, R., Naik, M.K.: A novel adaptive crossover bacterial foraging optimization algorithm for linear discriminant analysis based face recognition. Appl. Soft Comput. 30, 722–736 (2015)

    Article  Google Scholar 

  13. Tan, L., Lin, F., Wang, H.: Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with time windows. Nat. Comput. 151(3), 1208–1215 (2015)

    Google Scholar 

  14. Liu, J.: A study on yard truck scheduling and storage allocation using modified brain storm optimization algorithms. Unpublished Master’s thesis. Shenzhen University, Shenzhen, China (2018)

    Google Scholar 

  15. Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. 22(3), 52–67 (2002)

    Article  MathSciNet  Google Scholar 

  16. Xiao, L., Chen, J., Zuo, L., Wang, H., Tan, L.: Differential structure-redesigned-based bacterial foraging optimization. In: Tan, Y., Shi, Y., Tang, Q. (eds.) ICSI 2018. LNCS, vol. 10941, pp. 295–303. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93815-8_29

    Chapter  Google Scholar 

  17. Niu, B., Liu, J., Wu, T., Chu, X.H., Wang, Z.X., Liu, Y.M.: Coevolutionary structure-redesigned-based bacterial foraging optimization. IEEE/ACM Trans. Comput. Biol. Bioinf. (2017). https://doi.org/10.1109/TCBB.2017.2742946

    Article  Google Scholar 

  18. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281–295 (2006)

    Article  Google Scholar 

  19. EI-Abd, M.: Performance assessment of foraging algorithms vs. evolutionary algorithms. Inf. Sci. 182(1), 243–263 (2012)

    Google Scholar 

Download references

Acknowledgment

This work is partially supported by The National Natural Science Foundation of China (Grants No. 61472257, 71701134), Natural Science Foundation of Guangdong Province (2016A030310074, 2017A030310427), The HD Video R & D Platform for Intelligent Analysis and Processing in Guangdong Engineering Technology Research Centre of Colleges and Universities (No.GCZX-A1409), The Postgraduate Innovation Development Fund Project of Shenzhen University (PIDFP-RW2018015).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, L., Xiao, L., Zuo, L., Liu, J., Yang, C. (2018). Application of BFO Based on Path Interaction in Yard Truck Scheduling and Storage Allocation Problem. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 952. Springer, Singapore. https://doi.org/10.1007/978-981-13-2829-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2829-9_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2828-2

  • Online ISBN: 978-981-13-2829-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics