A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem

作者：Chen Sheu Hua^*

来源：Networks and Spatial Economics, 2010, 10(4): 509-523.

DOI：10.1007/s11067-008-9070-y

• Physical distribution
• Hub-and-spoke network
• Common carrier
• Heuristic

Designing a heuristic approach to solve time-definite common carrier operation planning problem is the purpose of this research. The time-definite common carrier operation planning is implemented using the arcs and nodes of a hierarchical hub-and-spoke network. In light of the complexity involved in determining the types of the vehicles, as well as their associated routing and scheduling simultaneously, we design an algorithm, which employs the concept of tabu search to solve the network structure problem. The testing data are obtained from the second largest time-definite common carrier in Taiwan. When applied to the data of this test case company, the designed tabu search algorithm can obtain final solutions in a relatively short time regardless of the level of service required. Carriers can plan their operations according to the solutions on the operation networks. Although it is possible that the designed heuristic algorithm may converge to a local optimal solution, it can be a meaningful approach for the industrial application that emphasizes the value of time and can be satisfied with a near-optimal solution.

• 出版日期2010-12