| Article ID: | iaor20021073 |
| Country: | Netherlands |
| Volume: | 132 |
| Issue: | 1 |
| Start Page Number: | 88 |
| End Page Number: | 105 |
| Publication Date: | Jul 2001 |
| Journal: | European Journal of Operational Research |
| Authors: | Sung C.S., Jin H.W. |
| Keywords: | programming: integer |
This paper considers a hub network design problem where the network service area partitioned into the predetermined zones (represented by node clusters) is given, and non-stop (direct link) service is allowed. The objective is to design a hub network under non-restrictive networking policy by determining all the required hub locations in the predetermined zones and also all the terminal-to-terminal routes such that the total network cost (hub construction and flow transportation cost) is minimized. For the design problem, a dual-based solution approach is proposed and tested for its effectiveness with numerical examples.