Genetic algorithm for the cargo shunting cooperation between two hub-and-spoke logistics networks

Jingjing Hu, Youfang Huang


Purpose: The overstocked goods flow in the hub of hub-and-spoke logistics network should be disposed of in time, to reduce delay loss and improve the utilization rate of logistics network resources. The problem we need to solve is to let logistics network cooperate by sharing network resources to shunt goods from one hub-and-spoke network to another hub-and-spoke network.

Design/methodology/approach: This paper proposes the hub shunting cooperation between two hub-and-spoke networks. Firstly, a hybrid integer programming model was established to describe the problem, and then a multi-layer genetic algorithm was designed to solve it and two hub-and-spoke networks are expressed by different gene segments encoded by genes. The network data of two third-party logistics companies in southern and northern China are used for example analysis at the last step. 

Findings: The hub-and-spoke networks of the two companies were constructed simultaneously. The transfer cost coefficient between two networks and the volume of cargo flow in the network have an impact on the computation of hubs that needed to be shunt and the corresponding cooperation hubs in the other network.

Originality/value: Previous researches on hub-and-spoke logistics network focus on one logistics network, while we study the cooperation and interaction between two hub-and-spoke networks. It shows that two hub-and-spoke network can cooperate across the network to shunt the goods in the hub and improve the operation efficiency of the logistics network. 


Hub-and-spoke network, hub shunting cooperation, multi-layer genetic algorithm, third-party logistics company

Full Text:



Licencia de Creative Commons 

This work is licensed under a Creative Commons Attribution 4.0 International License

Journal of Industrial Engineering and Management, 2008-2024

Online ISSN: 2013-0953; Print ISSN: 2013-8423; Online DL: B-28744-2008

Publisher: OmniaScience