Nothing Special   »   [go: up one dir, main page]

Skip to main content

Advertisement

Log in

A two-stage routing optimization model for yard trailers in container terminals under stochastic demand

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

The routing optimization of yard trailers in container terminal is an important issue for vehicle dispatching. Whether the vehicle dispatch is reasonable will determine the circulation efficiency of the container terminal. In order to better optimize the yard trailers routing under stochastic demand, a two-stage optimization model is established in this paper considered the constraint of vehicle capacity and travel distance, which aims at planning and determining the travel routing of the trailers and the operating sequence. To solve the two-stage optimization model, a particle swarm optimization algorithms (PSO) algorithm with exponentially decreasing weight strategy is introduced to search for a satisfied solution to ensure the feasibility of distribution plan and vehicle routing. And the optimal results of the simulation experimental reveal that satisfied solutions can be obtained by employing the two-stage optimization model constructed in this paper, which further verified the feasibility and validity of the optimization model and algorithm. The two-stage optimization model provides a practical and effective method to solve the trailers routing dispatching in container terminals under stochastic demand.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Erdoğan G (2017) An open source spreadsheet solver for vehicle routing problems. Comput Oper Res 84:62–72

    Article  MathSciNet  MATH  Google Scholar 

  2. Dantzig G, Ramser R (1959) The truck dispatching problem. Manag Sci 6(1):80–91

    Article  MathSciNet  MATH  Google Scholar 

  3. Nishimura E, Imai A, Papadimitriou S (2005) Yard trailer routing at a maritime container terminal. Transp Res Part E Logist Transp Rev 41(1):53–76

    Article  Google Scholar 

  4. Xu X, Hao J, Deng Y, Wang Y (2017) Design optimization of resource combination for collaborative logistics network under uncertainty. Appl Soft Comput 560(7):684–691

    Article  Google Scholar 

  5. Kumar RS, Kondapaneni K, Dixit V, Goswami A, Thakur LS, Tiwari MK (2016) Multi-objective modeling of production and pollution routing problem with time window: a self-learning particle swarm optimization approach. Comput Ind Eng 99:29–40

    Article  Google Scholar 

  6. Ng WC, Mak KL (2005) Yard crane scheduling in port container terminals. Appl Math Model 29:263–276

    Article  MATH  Google Scholar 

  7. Cao JX, Lee DH, Chen JH, Shi Q (2010) The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods. Transp Res Part E Logist Transp Rev 46:344–353

    Article  Google Scholar 

  8. Sadeghian SH, Ariffin MKAM, Tang SH, Ismail N (2014) Integrated dispatching model of automated lifting vehicles, quay cranes and yard cranesat automated container terminal. Adv Mech Manuf Eng 564:678–683

    Google Scholar 

  9. Huang SY, Guo X (2011) An improved least cost heuristic for dynamic yard crane deployment in container terminals. In: IEEE international conference on automation science and engineering trieste, pp 24–27

  10. Li W, Goh M, Wu Y, Petering MEH, de Souza R, Wu YC (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. Int J Prod Econ 136:332–343

    Article  Google Scholar 

  11. Luo J, Wu Y, Mendes AB (2016) Modelling of integrated vehicle scheduling and container storage problems in unloading process at an automated container terminal. Comput Ind Eng 94:32–44

    Article  Google Scholar 

  12. Bish EK, Leong TY, Li CL, Ng JWC, Simchi-Levi D (2001) Analysis of a new vehicle scheduling and location problem. Nav Res Logist 48:363–385

    Article  MathSciNet  MATH  Google Scholar 

  13. Kaveshgar N, Huynh N (2015) Integrated quay crane and yard truck scheduling for unloading inbound containers. Int J Prod Econ 159:168–177

    Article  Google Scholar 

  14. Zhang X, Zeng Q, Yang Z (2016) Modeling the mixed storage strategy for quay crane double cycling in container terminals. Transp Res Part E Logist Transp Rev 94:171–187

    Article  Google Scholar 

  15. Yan Z, Ismail H, Chen L, Zhao X, Wang L (2019) The application of big data analytics in optimizing logistics: a developmental perspective review. J Data Inf Manag 1:33–43

    Article  Google Scholar 

  16. Du J, Li X, Yu L, Dan R, Zhou J (2017) Multi-deport vehicle routing problem for hazardous materials transportation. Inf Sci 399:201–218

    Article  Google Scholar 

  17. Fan L, Liang C, She W (2016) Coupling model and its algorithm for coordinated scheduling of quay crane and truck under uncertain environment. J Comput Appl 36(3):843–848

    Google Scholar 

  18. Hemmelmayr V, Doerner KF, Hartl RF (2010) Vendor managed inventory for environments with stochastic product usage. Eur J Oper Res 202(3):686–695

    Article  MATH  Google Scholar 

  19. Bianchi L, Birattari M, Chiarandini M (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Math Model Algorithms 5(1):91–110

    Article  MathSciNet  MATH  Google Scholar 

  20. Van Hentenryck P, Bent R (2006) Online stochastic combinatorial optimization. MIT Press, Massachusetts

    MATH  Google Scholar 

  21. Zhen L, Lee L, Chew E (2011) A decision model for berth allocation under uncertainty. Eur J Oper Res 212(1):54–68

    Article  Google Scholar 

  22. Xu X, Zheng Y, Yu L (2018) A bi-level optimization model of LRP in collaborative logistics network considered backhaul no-load cost. Soft Comput 22:5385–5393

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  24. Lv M, Zhu J, Wang R (2012) Research on algorithm of vehicle routing problem with stochastic demand. J Transp Inf Saf 30(2):76–79

    Google Scholar 

  25. Hu Z (2013) Scheduling of container truck-and-trailer transport between two ports. J Chongqing Jiaotong Univ (Nat Sci) 32(02):313–317

    Google Scholar 

  26. Xu X, Hao J, Zheng Y (2020) Multi-objective artificial bee colony algorithm for multi-stage resource leveling problem in sharing logistics network. Comput Ind Eng 142:106338

    Article  Google Scholar 

  27. Hao J, Li J, Wu D, Sun X (2020) Portfolio optimisation of material purchase considering supply risk—a multi-objective programming mode. Int J Prod Econ 230:107803

    Article  Google Scholar 

  28. Bae S, Hwang H, Cho G, Goan M (2007) Integrated GA-VRP solver for multi-depot system. Comput Ind Eng 53(2):233–240

    Article  Google Scholar 

  29. Zapata A, Suarez E, Florez J (2019) Application of VRP techniques to the allocation of resources in an electric power distribution system. J Comput Sci 35:102–109

    Article  Google Scholar 

  30. Xiao Y, Konak A (2015) A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness. Appl Soft Comput 34:372–388

    Article  Google Scholar 

  31. Yu V, Lin S (2015) A simulated annealing heuristic for the open location-routing problem. Comput Oper Res 62:184–196

    Article  MathSciNet  MATH  Google Scholar 

  32. Qiu M, Fu Z, Eglese R, Tang Q (2018) A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups. Comput Oper Res 100:102–116

    Article  MathSciNet  MATH  Google Scholar 

  33. Silvestrin P, Ritt M (2017) An iterated Tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 81:192–202

    Article  MathSciNet  MATH  Google Scholar 

  34. Huang Y, Blazquez C, Huang S, Paredes-Belmar G, Latorre-Nuñez G (2019) Solving the feeder vehicle routing problem using ant colony optimization. Comput Ind Eng 127:520–535

    Article  Google Scholar 

  35. Okulewicz M, Mańdziuk J (2017) The impact of particular components of the PSO-based algorithm solving the dynamic vehicle routing problem. Appl Soft Comput 58:586–604

    Article  Google Scholar 

  36. Moghaddam B, Ruiz R, Sadjadi S (2012) Vehicle routing problem with uncertain demands: an advanced particle swarm algorithm. Comput Ind Eng 62(1):306–317

    Article  Google Scholar 

  37. Chen R, Shen Y, Hong W (2019) Neural-like encoding particle swarm optimization for periodic vehicle routing problems. Expert Syst Appl 138:112833

    Article  Google Scholar 

  38. Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371

    Article  Google Scholar 

  39. Hao J, Sun X, Feng Q (2020) A novel ensemble approach for the forecasting of energy demand based on the artificial bee colony algorithm. Energies 13:550

    Article  Google Scholar 

  40. Liu J, Ding L, Guan X, Gui J, Xu J (2020) Comparative analysis of forecasting for air cargo volume: statistical techniques vs. machine learning. J Data Inf Manag. https://doi.org/10.1007/s42488-020-00031-1

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yirui Deng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deng, Y., Chen, Y., Huang, J. et al. A two-stage routing optimization model for yard trailers in container terminals under stochastic demand. Evol. Intel. 16, 1853–1863 (2023). https://doi.org/10.1007/s12065-021-00566-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-021-00566-1

Keywords

Navigation