A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem

Diarrassouba, Ibrahima; Labidi, M. K.; Mahjoub, Ali Ridha

Diarrassouba, Ibrahima; Labidi, M. K.; Mahjoub, Ali Ridha (2018), A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem, Electronic Notes in Discrete Mathematics, 64, p. 305-314. 10.1016/j.endm.2018.02.005

Type

Article accepté pour publication ou publié

Date

2018

Journal name

Electronic Notes in Discrete Mathematics

Volume

Publisher

Elsevier

Pages

305-314

Publication identifier

10.1016/j.endm.2018.02.005

Metadata

Show full item record

Author(s)

Diarrassouba, Ibrahima
Laboratoire de Mathématiques Appliquées du Havre [LMAH]
Labidi, M. K.
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]

Abstract (EN)

In this paper, we consider the Steiner k-Edge-Connected Network Design Problem (SkESNDP). The problem finds its applications in the design of survivable telecommunications networks. We propose a parallel hybrid algorithm which aims to produce good solutions for large scale instances of the problem. Our approach is based on a Lagrangian relaxation of a flow-based integer programming formulation of the problem, a greedy and a genetic algorithms.

Subjects / Keywords

Lagrangian relaxation; large scale; genetic algorithm; hybridization; parallel computing; SkESNDP