Skip to content

Different approaches to solving wardropian cycles problem - a question whether agents in the system following a System Optimal assignment can achieve equal time of travel

Notifications You must be signed in to change notification settings

COeXISTENCE-PROJECT/Wardropian_cycles

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 

Repository files navigation

Wardropian_cycles

This repository aims to provide an experimental results for a wardropian cycle problem.

What are wardropian cycles?

In a traffic assignment problem, users do not follow System Optimum solution to the given network. Our aim is to provide an algorithmic solution that optimizes system time, but ensures that no driver is treated unfair - their mean time is better than one from User Equilibrium. In an attempt to achieve this, we analyze two solutions to each network assignment system calculated using Frank-Wolfe optimisation algorithm, and work on top on those.

Used algorithms

part of the code is based on this repository by Matteo Bettini adapted to our needs.

About

Different approaches to solving wardropian cycles problem - a question whether agents in the system following a System Optimal assignment can achieve equal time of travel

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published