Inspiration
...
What it does
Optimize the routing of an entire fleet of robotaxis towards certain goals, such as lowest distance traveled or lowest CO2 emissions across all cars.
How it optimizes it
We implemented an adaptive large neighborhood search based on the 2006 paper "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows" by Pissinger and Ropke. The algorithm starts with an iniail guess and then attempts to explores the solution space by removing candidate trips and reinserting them at better locations.
How we built it
We built a Rust backend that processes all data using a fancy algorithm, and a Vue frontend that displays the live updates to the vehicles' routing.
Challenges we ran into
Accomplishments that we're proud of
The cars move!! That's so future!
What we learned
What's next for y-router
Sleep.
Built With
- rust
- vue
Log in or sign up for Devpost to join the conversation.