Skip to Main content Skip to Navigation
New interface
Journal articles

Network pricing problem with unit toll

Lorenzo Castelli 1 Martine Labbé 2, 3 Alessia Violin 1, 3 
2 INOCS - Integrated Optimization with Complex Structure
Inria Lille - Nord Europe, ULB - Université libre de Bruxelles, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : In the so-called network pricing problem an authority owns some arcs of the network and tolls them, while users travel between their origin and destination choosing their minimum cost path. In this article, we consider a unit toll scheme, and in particular the cases where the authority is imposing either the same toll on all of its arcs, or a toll proportional to a given parameter particular to each arc (for instance a per kilometer toll). We show that if tolls are all equal then the complexity of the problem is polynomial, whereas in case of proportional tolls it is pseudo-polynomial, proposing ad-hoc solution algorithms and relating these problems to the parametric shortest path problem. We then address a robust approach using an interval representation to take into consideration uncertainty on parameters. We show how to modify the algorithms for the deterministic case to solve the robust counterparts, maintaining their complexity class.
Document type :
Journal articles
Complete list of metadata
Contributor : Bernard Fortz Connect in order to contact the contributor
Submitted on : Monday, December 19, 2016 - 4:13:55 PM
Last modification on : Tuesday, November 22, 2022 - 2:26:16 PM




Lorenzo Castelli, Martine Labbé, Alessia Violin. Network pricing problem with unit toll. Networks, 2017, 69 (1), pp.83--93. ⟨10.1002/net.21701⟩. ⟨hal-01419552⟩



Record views