Route optimization model in collaborative logistics network for mixed transportation problem considered cost discount based on GATS

  • Yirui DengEmail author
  • Yao Zheng
  • Jianping Li
Original Research


A mixed transportation problem with centralized and decentralized transportation is proposed in collaborative logistics network. All tasks can be centralized to transport for once, twice or transported directly to destination node. A route optimization programming model to minimize the total costs is proposed in consideration of cost discount, road section capacity, overload penalty, advance delivery cost and hard time window. The hybrid genetic tabu search algorithm is presented to solve the model. To test the feasibility and validity of proposed model and hybrid algorithm, a simulation example is presented and solved. The optimal solution of experiment shows that the hybrid algorithm can obtain better solution, better convergence speed and high calculation efficiency.


Collaborative logistics network Cost discount Road section capacity GATS 



This work was supported by the humanities and social science research project of Shandong Universities (J17RB103). And it also was supported by the Fundamental Research Funds for the Central Universities (18CX04004B).


  1. Abyazi-Sani R, Ghanbari R (2016) An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput Industr Eng 93:99–109CrossRefGoogle Scholar
  2. Alumur SA, Nickel S, Saldanha-da-Gama F, Seçerdin Y (2015) Multi-period hub network design problems with modular capacities. Annu Oper Res 246(1–2):1–24MathSciNetzbMATHGoogle Scholar
  3. Camargo RS, Miranda JR, Luna HPL (2009) Benders decomposition for hub problems with economies of scale. Ann Oper Res 41(4):421–451Google Scholar
  4. Campbell JF (2009) Hub location for time definite transportation. Comput Oper Res 36(12):3107–3116CrossRefzbMATHGoogle Scholar
  5. Chou YC, Chen YH, Chen HM (2014) Pickup and delivery routing with hub transshipment across flexible time periods for improving dual objectives on workload and waiting time. Transp Res Part E 61(61):98–114CrossRefGoogle Scholar
  6. Correia I, Nickel S, Saldanha-da- F (2010) Single-assignment hub location problems with multiple capacity levels. Transp Res Part B 44(8):1047–1066CrossRefGoogle Scholar
  7. Drexl M (2013) Applications of the vehicle routing problem with trailers and transshipments. Eur J Oper Res 227(2):275–283MathSciNetCrossRefGoogle Scholar
  8. Du J, Li X, Yu L, Dan R, Zhou J (2017) Multi-deport vehicle routing problem for hazardous materials transportation. Infor Sci 399(c):201–218CrossRefGoogle Scholar
  9. Ebery J, Krishnamoorthy M, Ernst A, Boland A (2000) The capacitated multiple allocation hub location problem: formulations and algorithms. Eur J Oper Res 120(3):614–631CrossRefzbMATHGoogle Scholar
  10. El-Ashmawi W, Jun H, Renfa L (2015) Stability coalition formation with cost sharing in multi-agent systems based on volume discount. Intern Arab J Inf Tech 12(3):296–303Google Scholar
  11. Gendreau M, Laporte G, Séguin R (2008) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Net 51(2):153–153CrossRefzbMATHGoogle Scholar
  12. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549MathSciNetCrossRefzbMATHGoogle Scholar
  13. Huang M, Cui Y, Lin WT, Ren L (2013) Multi-tasks fourth party logistics routing problem with cost discount. Contr Decis 28(7):997–1001zbMATHGoogle Scholar
  14. Jalali S, Seifbarghy M, Sadeghi J, Ahmadi S (2016) Optimizing a bi-objective reliable facility location problem with adapted stochastic measures using tuned-parameter multi-objective algorithms. Knowl Based Syst 95(C):45–57CrossRefGoogle Scholar
  15. Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1):50–71MathSciNetCrossRefzbMATHGoogle Scholar
  16. Jeyaraman K, Sugapriya C (2008) Transportation cost using deterministic inventory model with deteriorating items receives price discount. J Appl Sci Res 11:1414–1419Google Scholar
  17. Karimi O, Setak M (2014) Proprietor and customer costs in the incomplete hub location-routing network topology. Appl Math Model 38(3):1011–1023MathSciNetCrossRefzbMATHGoogle Scholar
  18. Lai DSW, Demirag OC, Leung JMY (2016) A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp Res Part E Logist Transp Rev 86:32–52CrossRefGoogle Scholar
  19. Li X, Zhou JD, Zhao XD (2016) Travel itinerary problem. Transp Res Part B 91:332–343CrossRefGoogle Scholar
  20. Liu CY (2013) An improved adaptive genetic algorithm for the multi-depot vehicle routing problem with time window. J Net 8(5):1035–1042Google Scholar
  21. Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421–451CrossRefzbMATHGoogle Scholar
  22. Razmi J, Rahmanniya F (2013) Design of distribution network using hub location model with regard to capacity constraint and service level. Intern J Logis Syst Manag 16(4):386–398Google Scholar
  23. Roni MS, Eksioglu SD, Cafferty KG, Jacobson JJ (2016) A multi-objective, hub-and-spoke model to design and manage biofuel supply chains. Ann Oper Res 249:1–30MathSciNetCrossRefzbMATHGoogle Scholar
  24. Song DP, Carter J (2010) Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Nav Res Logis 55(2):156–171MathSciNetCrossRefzbMATHGoogle Scholar
  25. Tsao YC, Zhang Q, Chen TH (2016) Multi-item distribution network design problems under volume discount on transportation cost. Intern J Prod Res 54(2):426–443CrossRefGoogle Scholar
  26. Weckman G (2015) Applying genetic algorithm to a new location and routing model of hazardous materials. Intern J Prod Res 53(3):916–928CrossRefGoogle Scholar
  27. Weng KR, Zhu KJ, Liu G (2015) Collaborative transportation route optimization with lower bound flows. J Syst Manag 24(1):38–42Google Scholar
  28. Xu XF, Zhang W, Li N (2015) A bilevel programming model of resource matching for collaborative logistics network in supply uncertainty environment. J Frankl Instit 352:3873–3884CrossRefzbMATHGoogle Scholar
  29. Xu XF, Hao J, Deng YR, Wang Y (2017) Design optimization of resource combination for collaborative logistics network under uncertainty. Appl Soft Comput 560(7):684–691CrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.School of Economics and ManagementChina University of PetroleumQingdaoChina
  2. 2.Institutes of Science and DevelopmentChinese Academy of SciencesBeijingChina

Personalised recommendations