Fair Railway Network Design

Zixu He, Sirin Botan, Jérôme Lang, Abdallah Saffidine, Florian Sikora +1 more
9/3/2024
cs.SIcs.AI

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{he2024fair,
  title  = {Fair Railway Network Design},
  author = {Zixu He and Sirin Botan and Jérôme Lang and Abdallah Saffidine and Florian Sikora and Silas Workman},
  year   = {2024},
  eprint = {2409.02152},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.02152v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.02152.svg)](https://codeofpaper.com/paper/2409.02152)

Discussion