Solving the hub location problem with modular link capacities
Computers and Operations Research
0305-0548 (print)1873-765X (online)
3227 - 3245
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/23953
This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not linear but stepwise and the capacity of a hub restricts the amount of traffic transiting through the hub rather than the incoming traffic. In this paper both an exact and a heuristic method are presented. They are compared and combined in a heuristic concentration approach to investigate whether it is possible to improve the results within limited computational times.