1. ¹ The Hankuk Aviation University, Hwajon-dong, Koyang-si, Kyunggi-do, Korea
2. ² The Ohio State University, Columbus, OH, USA

Correspondence: M-G Yoon, The Hankuk Aviation University, 200-1, Hwajon-dong, Koyang-si, Kyunggi-do, 411-791, Korea. E-mail: mgyoon@hau.ac.kr

Received 1 February 2005; Accepted 1 July 2006; Published online 25 October 2006.

Abstract

Many air, less-than-truck load and intermodal transportation and telecommunication networks incorporate hubs in an effort to reduce total cost. These hubs function as make bulk/break bulk or consolidation/deconsolidation centres. In this paper, a new hub location and network design formulation is presented that considers the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with the demands on the arcs. The problem is formulated as a mixed integer programming problem embedding a multi-commodity flow model. The formulation can be transformed into some previously modelled hub network design problems. We develop a dual-based heuristic that exploits the multi-commodity flow problem structure embedded in the formulation. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.