Skip to main content
Log in

QoS based deliver model of the packages transportation by the passenger train and solution algorithm

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

Abstract

In recent years, statistics show that the percentage of household consumption in GDP is getting higher and higher. One of the subsequent influences is that the transport demand for packages has increased sharply. Hence it is very necessary to propose diverse transport organization modes in accordance with the different situation in different countries. A kind of new transportation mode, multi-package multi-train pickup and delivery problem with time window (MPMT-PDPTW) is proposed in this paper. It aims to achieve express package transportation with minimum cost and maximize utilization of luggage car of a passenger train at the same time. Considering the multiple constraints, such as limited carrying capacity, fixed departing and accepting time, we define the quality of service (QoS) as the evaluation criteria for package express transportation by the passenger train. A kind of meta-heuristic algorithm, greedy randomized adaptive search procedure (GRASP), is designed to make full use of the redundant capacity of railway luggage car. An example is designed according to the railway passenger train timetable released by China Railway Corporation (CRC), the assignment schemes of packages at different railway stations reveal that the new transportation mode proposed in this paper is feasible and practical in package express transportation, and also has advantages in speed comparing with the highway and in transport cost over the airline.

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.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Andrew PA, Cynthia B, Keith AW (2002) Composite variable formulations for express shipment service network design. Transp Sci 36(1):1–20

    Article  Google Scholar 

  2. Anagnostopoulos KP, Chatzoglou PD, Katsavounis S (2010) A reactive greedy randomized adaptive search procedure for a mixed integer portfolio optimization problem. Manag Finance 36(12):1057–1065

    Google Scholar 

  3. Azadeh A, Asadzadeh SM, Jalali R, Hemmati S (2014) A greedy randomised adaptive search procedure—genetic algorithm for electricity consumption estimation and optimisation in agriculture sector with random variation. Int J Ind Syst Eng 17(3):285–301

    Google Scholar 

  4. Binato S, Oliveira GC, Araujo JL (2001) A greedy randomized adaptive search procedure for transmission expansion planning. IEEE Power Eng Rev 21(4):70–71

    Article  Google Scholar 

  5. Chan Y, Ponder RJ (1979) The small package air freight industry in the united states: a review of the Federal Express experience. Transp Res Part A 13A(1):221–229

    Article  Google Scholar 

  6. Chang SK, Yoon EM, Chung KH et al (2010) A study on strategic partership-based cutoff time adjustment for express package deliveries. International conference on computers & industry engineering, pp 1–6

  7. Chen C, Zhang D, Ma X et al (2017) Crowd delivery: planning city-wide package delivery paths leveraging the crowd of taxis. IEEE Trans Intell Transp Syst 18(6):1478–1496

    Google Scholar 

  8. Chen C, Yang S, Liu WC et al (2018) CrowdExpress: a probabilistic framework for on-time crowdsourced package deliveries. Other Comput Sci 1–18

  9. Daeki K, Cynthia B, Keith W, Gregory R (1999) Multimodal express package delivery: a service network design application. Transp Sci 33(4):391–407

    Article  Google Scholar 

  10. Dong H, Ning B, Cai B et al (2010) Automatic train control system development and simulation for high-speed railways. IEEE Circuits Syst Mag 10(2):6–18

    Article  Google Scholar 

  11. Faycal C, Riffi ME, Ahiod B (2015) Hybrid genetic algorithm and greedy randomized adaptive search procedure for solving a nurse scheduling problem. J Theor Appl Inf Technol 73(2):313–320

    Google Scholar 

  12. Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11(2):109–124

    Article  MathSciNet  Google Scholar 

  13. Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67–71

    Article  MathSciNet  Google Scholar 

  14. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109–133

    Article  MathSciNet  Google Scholar 

  15. Hart P, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6:107–114

    Article  MathSciNet  Google Scholar 

  16. Horner MW, O’kelly ME (2001) Embedding economies of scale concept for hub network design. J Transp Geogr 9:255–265

    Article  Google Scholar 

  17. Jeong SJ, Lee CG, Bookbinder JH (2007) The European freight railway system as a hub-and-spoke network. Transp Res Part A Policy Pract 41:523–536

    Article  Google Scholar 

  18. Joshuah KS, Constantine S, Emma RO et al (2018) Energy use and life cycle greenhouse gas emissions of drones for commercial package delivery. Nat Commun. https://doi.org/10.1038/s41467-017-02411-5

    Article  Google Scholar 

  19. Laguna M, Kelly JP, Gonzalez-Velarde J et al (1995) Tabu search for the multilevel generalized assignment problem. Eur J Oper Res 82(1):176–189

    Article  Google Scholar 

  20. Lin CC, Chen SH (2004) The hierarchical network design problem for time-definite express common carriers. Transp Res Part B 38:271–283

    Article  Google Scholar 

  21. Li XM, Lu HY (2005) Optimization of train formation diagram of express freight. China Railw Sci 25(2):117–120

    Google Scholar 

  22. Li XM, She Y, Zhu XL et al (2005) Application of the fuzzy clustering analysis in the planning of express freight transportation network. China Railw Sci 26(4):124–129

    Google Scholar 

  23. Liang XH, Tan KH (2014) Research on the development model of Express Freight Transport on High-speed Railway in German. Chin Railw 13(5):11–15, 42

  24. Miller J, Nie Y, Stathopoulos A (2017) Crowdsourced urban package delivery modeling: traveler willingness to work as crowdshippers. J Transp Res Board 2610:67–75

    Article  Google Scholar 

  25. Neil M, Stephen LS, Steven LW et al (2015) Planning paths for package delivery in heterogeneous multi-robot teams. IEEE Trans Autom Sci Eng 12(4):1298–1308

    Article  Google Scholar 

  26. (2005) Freight transportation network. China Railw Sci 26(4):124–129

  27. Pazour JA, Meller RD, Pohl LM (2010) A model to design a national high-speed rail network for freight Distribution. Transp Res Part A 44:119–135

    Google Scholar 

  28. Ross HJ (1972) Loading strategies for a freight transport system. Socio-Econ Plan Sci 6:87–93

    Article  Google Scholar 

  29. Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8(1):91–103

    Article  MathSciNet  Google Scholar 

  30. Shuai B, Deng SW, Huang LX (2014) Railway express freight consumer market segmentation based on improved RFM method. J Railw Sci Eng 11(1):112–117

    Google Scholar 

  31. Shuai B, Tang LL, Huang LX (2014) Analysis of railway express freight transport product structure and marketing strategy based on Boston matrix method. J Railw Sci Eng 11(2):111–115

    Google Scholar 

  32. Souza DS, Santos HG, Coelho IM (2017) A hybrid heuristic in gpu-cpu based on scatter search for the generalized assignment problem. Procedia Comput Sci 108:1404–1413

    Article  Google Scholar 

  33. Tan KH, Zhang Y (2014) Research on the development model of Express Freight Transport on High-speed Railway in European. Chin Railw 13(1):17–22

    Google Scholar 

  34. Theodoros G, Leonidas P (2015) A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. J Comb Optim 29(4):859–883

    Article  MathSciNet  Google Scholar 

  35. Wang BH, He SW, Song R et al (2009) Optimization model and algorithm of dynamic express shipment service network design. J China Railw Soc 31(5):17–22

    CAS  Google Scholar 

  36. Yagiura M, Ibaraki T, Glover F (2004) An ejection chain approach for the generalized assignment problem. Informs J Comput 16(2):133–151

    Article  MathSciNet  Google Scholar 

  37. Yagiura M, Ibaraki T, Glover F (2006) A path relinking approach with ejection chains for the generalized assignment problem. Eur J Oper Res 169(2):548–569

    Article  MathSciNet  Google Scholar 

  38. Yu XQ, Lang MX, Gao Y et al (2018) An empirical study on the design of China high-speed rail express train operation plan-from a sustainable transport perspective. Sustainability 10(2478):1–19

    CAS  Google Scholar 

  39. Yuan M, Chen MY, Yu XJ (2009) How to maximize the value for fast transport products of small pieces of goods. China Road Transp 01:25–26

    Google Scholar 

  40. Zhang YZ, Yan YS (2014) A multi-objective model and algorithm of operation plan for express freight trains. J Transp Syst Eng Inf Technol 14(3):111–116

    Article  Google Scholar 

  41. Zhang YK, Qin SP (2013) Research on the feasibility of express freight transport on high-speed railway in China. Mech Mater 397–400:2647–2650

    Article  ADS  Google Scholar 

Download references

Acknowledgements

This work was supported by National Science Fund of China (71671079), Nature Science Fund of Gansu Province of China (18JR3RA107), Science and Technology Program Fund of Gansu Province of China (18CX3ZA004).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juhua Yang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, J., Liu, L. & Chen, G. QoS based deliver model of the packages transportation by the passenger train and solution algorithm. Evol. Intel. 17, 107–122 (2024). https://doi.org/10.1007/s12065-020-00543-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-020-00543-0

Keywords

Navigation