Multi-task transportation scheduling model with backhauls based on hub and spoke in collaborative logistics network

  • Xiaofeng XuEmail author
  • Yuping Sun
  • Jue Wang
Original Research


Hub and spoke collaborative logistics network has recently received considerable attention in terms of resource scheduling problem. In view of that problem such as low scale merit, inefficient resource utilization and conflict of interest between the operator and customer in the process of network operation, the paper seeks to formulate the scheduling strategy for multiple logistics tasks oriented to multi-origin and multi-destination on the basis of multiple-allocation-hybrid H&S collaborative network (including two layers). Taking the backhaul resource, resource departure time, capability limitation, task delay penalty, etc. into account, the aim of the problem is to minimize both total cost and total time for the task set. According to the characteristics of the problem, the immune genetic algorithm based on three-layer encoding mechanism is designed to solve the model. Moreover, the models and algorithms are validated by extensive results of numerical examples.


Hub and spoke network Collaborative logistics Backhauls Logistics service integrator Immune genetic algorithm 



This work was supported by the Fundamental Research Funds for the Central Universities, China (Grant no. 17CX04023B).


  1. Deif I, Bodin LD (1984) Extension of the clarke and wright algorithm for solving the vehicle routing problem with backhauling. In: proceeding of the babson conference on software users in transportation and logistics management, MA: Babson ParkGoogle Scholar
  2. Du JM, Li X, Yu LA, Ralescu D (2017) Fuzzy bilevel programming for multi-depot vehicle routing problem with hazardous materials transportation. Inf Sci 399:201–218Google Scholar
  3. Feng YL, Guo L, Suresh PS (2018) A three-layer chromosome genetic algorithm for multi-cell scheduling with flexible routes and machine sharing. Int J Prod Econ 196:269–283Google Scholar
  4. Ferrucci F, Bock S, Gendreau M (2013) A pro-active real-time control approach for dynamic vehicle routing problem dealing with the delivery of urgent goods. Eur J Oper Res 225(1):130–141Google Scholar
  5. Gabriel GJ, Guy D, Gilbert L, Vladimir M (2010) A branch-and-price algorithm for the vehicle routing problem with deliveries, Selective Pickups and Time Windows. Eur J Oper Res 206(2):341–349zbMATHGoogle Scholar
  6. Grazia SM (2018) Trends in transportation and logistics. Eur J Oper Res 264(3):830–836MathSciNetzbMATHGoogle Scholar
  7. Gulcin DY, Nihal E (2015) Fuzzy multi-objective programming algorithm for vehicle routing problems with backhauls. Expert Syst Appl 42(13):5632–5644Google Scholar
  8. Huang LX, Shuai B, Wang WX (2015) Optimization of hub-and-spoke service network design for railway express freight train. Appl Res Comput 32(07):1974–1978 (Chinese) Google Scholar
  9. Isabel C, Stefan N, Francisco S (2011) Hub and spoke network design with single-assignment, capacity decisions and balancing requirements. Appl Math Model 35(10):4841–4851MathSciNetzbMATHGoogle Scholar
  10. Jarek N, ‎ Jennifer M, ‎ Jan W (2004) Grid resource management: state of the art and future trends. Kluwer Academic Publishers, NorwellzbMATHGoogle Scholar
  11. Jiang BX, Ming Z (2017) A reactive container rerouting model for container flow recovery in a hub-and-spoke liner shipping network. Marit Policy Manag 44(6):744–760Google Scholar
  12. Julia S, Uwe C (2013) Heuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic. Electron Notes Discret Math 41:13–20Google Scholar
  13. Kuo RJ, Lee YH, Ferani EZ, Tien FC (2015) Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm. Appl Math Comput 266:1013–1026MathSciNetGoogle Scholar
  14. Lee JH, Moon I (2014) A hybrid hub-and-spoke postal logistics network with realistic restrictions: a case study of Korea post. Expert Syst Appl 41(11):5509–5519Google Scholar
  15. Li X, Zhou JD, Zhao XD (2016) Travel itinerary problem. Transp Res Part B 91:332–343Google Scholar
  16. Madjid T, Mohammad RK, Amin V, Mohammadsadegh M (2016) An artificial immune algorithm for ergonomic product classification using anthropometric measurements. Measurement 94:621–629Google Scholar
  17. Marco A, Alessandro C, Peter N, Piet R (2005) Network competition—the coexistence of hub-and-spoke and point-to-point systems. J Air Transp Manag 11(5):328–334Google Scholar
  18. Marcos R, Claudio B (2017) A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. Eur J Oper Res 262(3):954–965MathSciNetzbMATHGoogle Scholar
  19. Matthew GK, Konstantinos K, Evangelos S (2009) Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transp Res Part E 45(1):210–221Google Scholar
  20. Oscar D, Daniel G, Angel AJ, Ignacio N (2016) A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. Eur J Oper Res 255(2):442–462MathSciNetzbMATHGoogle Scholar
  21. Rafay I, Charles RS (2012) Design of intermodal logistics networks with hub delays. Eur J Op Res 220(3):629–641MathSciNetzbMATHGoogle Scholar
  22. Tasan AS, Gen M (2012) A genetic algritm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput Ind Eng 62(3):755–761Google Scholar
  23. Vincent FY, Shih WL (2014) Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Appl Soft Comput 24:284–290Google Scholar
  24. Vitória P, Reinaldo M, Marc R (2012) Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW. Eur J Oper Res 218(3):636–647MathSciNetzbMATHGoogle Scholar
  25. Wang TY, Zhao J, Sheng CY, Wang W, Wang LQ (2016) Multi-layer encoding genetic algorithm-based granular fuzzy inference for blast furnace gas scheduling. IFAC-Papers Line 49(20):132–137Google Scholar
  26. Xu XF, Zhang W, Li N et al (2015) A bi-level programming model of resource matching for collaborative logistics network in supply uncertainty environment. J Frankl Inst 352:3873–3884MathSciNetzbMATHGoogle Scholar
  27. Xu XF, Hao J, Deng YR, Wang Y (2017) Design optimization of resource combination for collaborative logistics network under uncertainty. Appl Soft Comput 56:684–691Google Scholar
  28. Yang LQ (2015) Scheduling model of feeder line multi-hull container ships based on hub-and-spoke network. Chin J Manag Sci 23(S1):860–864 (Chinese) Google Scholar
  29. Yang K, Yang LX, Gao ZY (2016) Planning and optimization of intermodal hub-and-spoke network under mixed uncertainty. Transp Res Part E 95:248–266Google Scholar
  30. Zhang T, Chaovalitwongse WA, Zhang YJ (2012) Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput Oper Res 39(10):2277–2290MathSciNetzbMATHGoogle Scholar
  31. Zhou L, Wang X, Lin Y, Jing Y (2016) Integrated multi-task scheduling for spatially distributed small-batch logistics. Comput Integr Manuf Syst 22(03):822–832 (Chinese) Google Scholar
  32. Zuhal K, Servet H, Andreas TE (2017) Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery. Transp Res Part E 108:141–159Google Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Economic ManagementChina University of PetroleumQingdaoChina
  2. 2.Academy of Mathematics and Systems Science, Chinese Academy of SciencesBeijingChina

Personalised recommendations