Research on Hubs Optimization for Non-Strict Hub-and-Spoke Logistics Network with Nodes Cost
Guanghua Yang, Min Zou
Abstract
Guanghua Yang, Min Zou
Abstract
On the basis of logistics network's reality circumstances, the paper puts forward a model of hubs optimization for non-strict hub-and-spoke logistics network specifying nodes cost. The paper uses Tabu search algorithm combined with Floyd to solve the model. The model and algorithm are tested by example of logistics network, and result indicates that the model and algorithm are usable for hubs optimization.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
On the basis of logistics network's reality circumstances, the paper puts forward a model of hubs optimization for non-strict hub-and-spoke logistics network specifying nodes cost. The paper uses Tabu search algorithm combined with Floyd to solve the model. The model and algorithm are tested by example of logistics network, and result indicates that the model and algorithm are usable for hubs optimization.
Key concepts: Tabu search, Computer science, USable, Spoke-hub distribution paradigm, Mathematical optimization, Operations research, Computer network, Engineering