Scientiae Mathematicae Japonicae
Online ISSN : 1346-0447
A DUAL BASED HEURISTIC FOR A HUB-SPOKE AIR CARGO NETWORK DESIGN PROBLEM WITH HOP-COUNT CONSTRAINTS
Moon-Gil YoonDuk-Young YoonSang-Heon Han
著者情報
ジャーナル フリー

2006 年 64 巻 1 号 p. 77-90

詳細
抄録
In this paper, we address a hub-spoke network design problem for air-cargo systems. To build such a network, three kinds of network costs should be considered: fixed costs for establishing a hub, fixed costs for operating air-cargo on each route and variable costs occurring on each route. With these kinds of costs, we develop an optimization model for designing a hub-spoke network in air-cargo systems, including the hop-count constraint being used effectively to deliver freights. We suggest a dual based heuristic algorithm to solve our problem. Computational experiments show that the proposed heuristic is satisfactory in both speed and the quality of the solutions generated.
著者関連情報
© 2006 International Society for Mathematical Sciences
前の記事 次の記事
feedback
Top