Maximum Concurrent Flow with Incomplete Data

Pierre-Olivier Bauguion 1 Claudia D’ambrosio 2 Leo Liberti 2
1 IRT SystemX - IRT SystemX
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : The Maximum Concurrent Flow Problem (MCFP) is often used in the planning of transportation and communication networks. We discuss here the MCFP with incomplete data. We call this new problem the Incomplete Maximum Concurrent Flow Problem (IMCFP). The main objective of IMCFP is to complete the missing information assuming the known and unknown data form a MCFP and one of its optimal solutions. We propose a new solution technique to solve the IMCFP which is based on a linear programming formulation involving both pri-mal and dual variables, which optimally decides values for the missing data so that they are compatible with a set of scenarios of different incomplete data sets. We prove the correctness of our formulation and benchmark it on many different instances.
Keywords : transportation systems uncertainty unknown data incomplete data multi-commodity flow problems Maximum concurrent flow inverse optimization
Document type :
Book sections
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-02105082
Contributor : Leo Liberti <>
Submitted on : Saturday, April 20, 2019 - 12:44:55 AM
Last modification on : Tuesday, June 4, 2019 - 11:28:28 AM

File

isco18b.pdf
Files produced by the author(s)

Identifiers

Collections

LIX | X-LIX | X | X-DEP-INFO | UNIV-PARIS-SACLAY | IRT-SYSTEMX

Citation

Pierre-Olivier Bauguion, Claudia D’ambrosio, Leo Liberti. Maximum Concurrent Flow with Incomplete Data. Combinatorial Optimization 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers, pp.77-88, 2018, 978-3-319-96150-7. ⟨10.1007/978-3-319-96151-4_7⟩. ⟨hal-02105082⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

16

Files downloads

13

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD