Heuristics for hub location problems with alternative capacity levels and allocation constraints

Authors:
Jeng-Fung Chen
Affiliations:
Department of Industrial Engineering & Systems Management, Feng Chia University, Taiwan
Venue:
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Year:
2013

Citing 4
Cited 0

Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Solving the Hub location problem in telecommunication network design: A local search approach

Networks
Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation

Computational Optimization and Applications
Twenty-Five Years of Hub Location Research

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the hub location problem in which the capacity of a hub restricts the amount of traffic transiting through the hub, the capacity of a hub is a decision variable, and each non-hub can only be allocated to a certain number of hubs. The objective is to determine the number of hubs, to locate the hubs, to determine the capacity level of each hub, to allocate the non-hubs to the hubs, and to determine the path for each origin-destination pair such that the total cost is minimized. Two heuristics based on the threshold accepting method are proposed to resolve this type of hub location problems. Computational characteristics of the proposed heuristics are evaluated through computational experiments using the modified CAB and AP data sets.