Fair Railway Network Design
Preprint
Abstract
When designing a public transportation network in a country, one may want to minimise the sum of travel duration of all inhabitants. This corresponds to a purely utilitarian view and does not involve any fairness consideration, as the resulting network will typically benefit the capital city and/or large central cities while leaving some peripheral cities behind. On the other hand, a more egalitarian view will allow some people to travel between peripheral cities without having to go through a central city. We define a model, propose algorithms for computing solution networks, and report on experiments based on real data.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Participatory Budgeting: Models and Approaches2020
- Fair solutions for some multiagent optimization problemsAutonomous Agents and Multi-Agent Systems, 2012
- Determinants of transport mode choice: a comparison of Germany and the USAJournal of Transport Geography, 2011
- Finding socially best spanning treesTheory and Decision, 2010
- Choquet-based optimisation in multiobjective shortest path and spanning tree problemsEuropean Journal of Operational Research, 2010
- Maximizing the minimum voter satisfaction on spanning treesMathematical Social Sciences, 2009
- Fair Division and Collective Welfare2003
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning TreesSIAM Journal on Computing, 2000
- Worst-Case Analysis of Network Design Problem HeuristicsSIAM Journal on Algebraic Discrete Methods, 1980
- Exact and approximate algorithms for optimal network designNetworks, 1979