alessandrositta/Flatland_challenge

Repository containing the code and explanation of a solution to the Flatland Challenge problem.

20
/ 100
Experimental

This project provides a solution to the Flatland Challenge, which involves optimizing train movement on a railway network. It takes in railway network layouts and train starting/ending points, and outputs efficient schedules for single or multiple trains to reach their destinations, even with malfunctions. This is useful for anyone interested in applying advanced AI techniques to complex scheduling and logistics problems.

No commits in the last 6 months.

Use this if you are exploring reinforcement learning approaches for multi-agent scheduling challenges, particularly in a simulated railway environment.

Not ideal if you are looking for a ready-to-deploy, production-grade train scheduling system for real-world operations.

transport-logistics railway-scheduling multi-agent-systems optimization-algorithms simulation-modeling
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 4 / 25
Maturity 8 / 25
Community 8 / 25

How are scores calculated?

Stars

8

Forks

1

Language

Python

License

Last pushed

Jul 28, 2020

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/agents/alessandrositta/Flatland_challenge"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.