An Optimal Design for the Capacitated Hub Location Problem with Asymmetric Allocation

Abstract:

Hub and Spoke (H&S) network reflecting the scale economies through consolidation and a large amount of freight transportation is widely used to reduce total transportation costs. H&S network has transportation routes that go to the final delivery point pass through hub linking destination from hub linking origin. In this paper we present a 0-1 integer programming model and a solution method for the capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. As the CAAHLP has impractically demanding for the large sized problem, we develop a solution method based on ant colony optimization algorithm. We investigate performance of the proposed solution method through the comparative study. The experimental results show that the newly proposed asymmetrically allocated network can provide better solution than the singly allocated network in terms of cost and service level.

• Periodical: Applied Mechanics and Materials (Volumes 284-287)
• Pages: 1203-1207
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.284-287.1203
• Online since: January 2013
• Authors: Ji Ung Sun
• Keywords: Ant Colony Optimization (ACO), Asymmetric Allocation, Capacitated Hub Location Problem

References

[1] J. F. Campbell: Integer programming formulations of discrete hub location problems. European Journal of Operational Research. Vol. 72 (1994), p.387~405.

DOI: 10.1016/0377-2217(94)90318-2

[2] J. Ebery, M. Krishnamoorthy, A. Ernst and N. Boland: The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research. Vol. 120 (2000), p.614~631.

DOI: 10.1016/s0377-2217(98)00395-6

[3] S. Chamberland, B. Sanso and O. Marcotte: Topological design of two-level telecommunication networks with modular switches. Operations Research. Vol. 48 (2000), p.745~760.

DOI: 10.1287/opre.48.5.745.12412

[4] A. Ernst and M. Krishnamoorthy: Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research. Vol. 86 (1999), p.141~159.

[5] M. Randall: Solution approaches for the capacitated single allocation hub location problem using ant colony optimization. Computational Optimization and Applications. Vol. 39 (2008), p.239~261.

DOI: 10.1007/s10589-007-9069-1