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.
This is a preview of subscription content, log in to check access.
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).
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
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
Camargo RS, Miranda JR, Luna HPL (2009) Benders decomposition for hub problems with economies of scale. Ann Oper Res 41(4):421–451Google Scholar
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
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
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
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
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
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
Weng KR, Zhu KJ, Liu G (2015) Collaborative transportation route optimization with lower bound flows. J Syst Manag 24(1):38–42Google Scholar
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
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