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

Authors:
E. G. Ortiz-García;L. Martínez-Bernabeu;S. Salcedo-Sanz;F. Flórez-Revuelta;A. M. Pérez-Bellido;A. Portilla-Figueras
Affiliations:
Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Department of Computing Technology, Universidad de Alicante, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Department of Computing Technology, Universidad de Alicante, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 8
Cited 1

Telecommunications network design algorithms

Telecommunications network design algorithms
Genetic algorithm crossover operators for ordering applications

Computers and Operations Research - Special issue on genetic algorithms
Heuristic algorithms for the terminal assignment problem

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Solving the hub location problem with modular link capacities

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Solving the uncapacitated hub location problem using genetic algorithms

Computers and Operations Research
A hub location problem with fully interconnected backbone and access networks

Computers and Operations Research
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access

Operations Research Letters

An evolutionary linear programming algorithm for solving the stock reduction problem

International Journal of Computer Applications in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a parallel evolutionary algorithm to tackle the Fully Interconnected Network Design Problem (FINDP), a specific application of hub location to network design. The FINDP has been recently proposed as an NP-hard combinatorial optimization problem formed by two smaller sub-problems: first, given the nodes which form the network, classify them as belonging to the backbone network or not. The second sub-problem consists of assigning the access network to a hub (node of the backbone network). In this paper we propose a parallel evolutionary algorithm to tackle the FINDP. We describe the architecture and how to structure the algorithm to solve the problem. Experimental tests have been carried out in several synthetic instances, and a comparison with existing approaches have shown the good performance of our algorithm.