Heuristic Approaches for Solving Hub Location Problem
碩士 === 大葉大學 === 工業工程研究所 === 89 === The location of hub facilities is fundamental to the design of a “hub-and-spoke network”, as it greatly affects the total transportation costs of system. Hub is a special type of facility, which is designed to act as switching point for internal flows of a networ...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26879423422622691286 |
| Summary: | 碩士 === 大葉大學 === 工業工程研究所 === 89 === The location of hub facilities is fundamental to the design of a “hub-and-spoke network”, as it greatly affects the total transportation costs of system. Hub is a special type of facility, which is designed to act as switching point for internal flows of a network. The problem is to determine the optimal location for the hubs and the assignments of the nonhubs to hubs that minimizes the overall transportation cost. Due to its characteristics of NP-Complete, it is difficult to obtain optimal solution within an acceptable amount of time.
In this study we consider both single and multiple allocation hub location problems. A heuristic algorithm based on a hybrid of simulated annealing (SA) and Tabu list is developed. Besides, a Lagrangian relaxation approach is also presented to solve this problem.
Both heuristic approaches presented in this study compare favorably with the computational results obtained from the literature. The results indicate that both methods proposed are capable of obtaining good solutions in a very small amount of time.
|
|---|