https://github.com/coexistence-project/wardropian_cycles
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
Science Score: 26.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (5.6%) to scientific vocabulary
Keywords
Repository
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
Basic Info
Statistics
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
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.
Owner
- Name: COeXISTENCE-PROJECT
- Login: COeXISTENCE-PROJECT
- Kind: organization
- Repositories: 1
- Profile: https://github.com/COeXISTENCE-PROJECT
GitHub Events
Total
- Watch event: 1
- Push event: 15
Last Year
- Watch event: 1
- Push event: 15