Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02192562
Contributor : Ikram Bouras <>
Submitted on : Wednesday, July 24, 2019 - 3:19:16 AM
Last modification on : Wednesday, May 26, 2021 - 3:01:24 PM

File

exact-algorithms-fixed (6).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02192562, version 1

Citation

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow. ROADEF: Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France. ⟨hal-02192562⟩

Share

Metrics

Record views

93

Files downloads

27