Optimization Online


Solving the Hub Location Problem with Modular Link Capacities

Hande Yaman (hyaman***at***bilkent.edu.tr)
Giuliana Carello (giuliana.carello***at***polito.it)

Abstract: 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 an 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 to investigate whether it is possible to improve the results within limited computational times.

Keywords: hub location, branch and cut, tabu search

Category 1: Applications -- OR and Management Sciences (Telecommunications )

Category 2: Combinatorial Optimization (Branch and Cut Algorithms )

Category 3: Combinatorial Optimization (Meta Heuristics )

Citation: Computers and Operations Research, Vol. 32, 3227-3245, 2005.


Entry Submitted: 12/11/2003
Entry Accepted: 12/11/2003
Entry Last Modified: 06/21/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society