Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow

Résumé

Introduction The Fixed Charge Network Design Problem (FCNDP) consists in selecting a subset of edges from a given network, in such a way that a set of commodities can be transported from its origins to its destinations. The objective is to minimize the sum of fixed costs (depending on the selected edges) and variable costs (depending on the flow of commodities on the edges). There are several variants of FCNDP in the literature, each of which considers a particular objective function or takes into account specific additional constraints. Herein we are interested in a specific variant of the FCNDP, namely Fixed Charge Network Design Problem with User Optimal Flow (FCNDP-UOF). This problem combines the FCNDP with multiple shortest path problems.
Fichier principal
Vignette du fichier
exact-algorithms-fixed (6).pdf (244.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02192562 , version 1 (24-07-2019)

Identifiants

  • HAL Id : hal-02192562 , version 1

Citer

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow. ROADEF 2018 - 19e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France. ⟨hal-02192562⟩
93 Consultations
30 Téléchargements

Partager

Gmail Facebook X LinkedIn More