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
Author information
JOURNAL FREE ACCESS

2006 Volume 64 Issue 1 Pages 77-90

Details
Abstract
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.
Content from these authors
© 2006 International Society for Mathematical Sciences
Previous article Next article
feedback
Top