• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

A parallel hybrid optimization algorithm for some network design problems

Thumbnail
Date
2019
Indexation documentaire
Modèles mathématiques. Algorithmes
Subject
Genetic algorithm; Hybridization; kHNDP; kESNDP; Lagrangian relaxation; Metaheuristic; Parallel computing
Nom de la revue
Soft Computing
Volume
23
Numéro
6
Date de publication
2019
Pages article
1947-1964
DOI
http://dx.doi.org/10.1007/s00500-017-2907-x
URI
https://basepub.dauphine.fr/handle/123456789/20648
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Diarrassouba, Ibrahima
Labidi, Mohamed Khalil
Mahjoub, Ali Ridha
Type
Article accepté pour publication ou publié
Résumé en anglais
Network design problems have been widely studied in the last decades due to the importance of ICT in our daily life and are still the subject of extensive researches. Network design covers a large family of problems, and several algorithms, both exact and heuristic methods, have been proposed to address each of them. In this paper, we consider two variants of the so-called survivable network design problem and propose a generic parallel hybrid algorithm to solve them. The algorithm is based on the hybridization of a Lagrangian relaxation algorithm, a greedy algorithm and a genetic algorithm. We present, for each variant, a computational study showing the efficiency of our approach in producing both lower and upper bounds for the optimal solution.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.