Solving the hub location problem with modular link capacities

Authors:
Hande Yaman;Giuliana Carello
Affiliations:
Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, Turkey;Dipartimento di Automatica ed Informatica, Politecnico di Torino, Corso Duca degli Abruzzi, Torino, Italy
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 8
Cited 6

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Heuristic concentration for the p-median: an example demonstrating how and why it works

Computers and Operations Research
Topological Design of Two-Level Telecommunication Networks with Modular Switches

Operations Research
On the Design Problem of Multitechnology Networks

INFORMS Journal on Computing
A branch and cut algorithm for hub location problems with single assignment

Mathematical Programming: Series A and B
Projecting the flow variables for hub location problems

Networks
Solving the Hub location problem in telecommunication network design: A local search approach

Networks

A mixed-integer approach to Core-Edge design of storage area networks

Computers and Operations Research
Lower and upper bounds for a two-level hierarchical location problem in computer networks

Computers and Operations Research
Star p-hub median problem with modular arc capacities

Computers and Operations Research
Multiple allocation hub-and-spoke network design under hub congestion

Computers and Operations Research
A conditional p-hub location problem with attraction functions

Computers and Operations Research
A parallel evolutionary algorithm for the hub location problem with fully interconnected backbone and access networks

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.02

Visualization

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 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.