主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2019, Vol. 27 ›› Issue (9): 175-182.doi: 10.16381/j.cnki.issn1003-207x.2019.09.017

• Articles • Previous Articles     Next Articles

Optimization of Task-Route Matching Based on Muti-Hub and Spoke Collaborative Logistics Network

XU Xiao-feng, SUN Yu-ping   

  1. School of Economics and Management, China University of Petroleum, Qingdao 266580, China
  • Received:2017-11-08 Revised:2017-12-28 Online:2019-09-20 Published:2019-09-29

Abstract: To advance scale merit of the logistics network, and balance the conflicts of interests between operators and customers, an optimization strategy of task-route matching is proposed on the basis of multi-hub and spoke collaborative logistics network.Firstly, under the condition of a given logistics network, considering resource departure time, capability limitation, dynamic cost discount coefficient and task delay penalty, a mathematical model oftask-route matching is established, which is from the point of logistics integration service provider and committed tominimize total cost as well as total time. Then,according to the characteristics of the problem, the genetic algorithm based on three-layers code is designed to solve the model. Meanwhile,the multi-point crossover and mutation mechanism are used to improve computing efficiency.Finally, research results show that centralized transportation could significantly reduce the execution cost of the task set,however, when the negative effect such as delivery delay and customer satisfaction decrease have exceeded the positive effect it brought about, the direct transport route should be appropriately introduced to improve the overall benefit.

Key words: hub and spoke network, collaborative logistics, logistics integration service provider, optimization of task-route matching, genetic algorithm

CLC Number: