Fair User Equilibrium in a Transportation Space-Time Network

Lianne A.M. Bruijns, Frank Phillipson*, Alex Sangers

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review


Central in this paper is a transportation network, in which containers are transported for multiple agents. This network is modelled by a Space Time Network, in which the travel time of modalities is fixed and independent of the occupancy of the network. To find the best allocation of containers to paths in this network, a flow problem can be solved. The System Optimal solution found then is the solution in which the total costs of the network are minimised. This paper introduces the idea of a fair User Equilibrium solution in such problem. The proposed approach changes the network, using a toll scheme, such that the fair User Equilibrium Solution in this changed network equals the System Optimal solution in the original network. This can be used to fairly redistribute the cost of the network among the users.

Original languageEnglish
Title of host publicationComputational Logistics - 11th International Conference, ICCL 2020, Proceedings
EditorsEduardo Lalla-Ruiz, Martijn Mes, Stefan Voß
ISBN (Print)9783030597467
Publication statusPublished - 2020
Externally publishedYes
Event11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands
Duration: 28 Sep 202030 Sep 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12433 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Conference on Computational Logistics, ICCL 2020


  • Intermodal and synchromodal transport
  • Space Time Network
  • System Optimal solution
  • User Equilibrium


Dive into the research topics of 'Fair User Equilibrium in a Transportation Space-Time Network'. Together they form a unique fingerprint.

Cite this