Smart Ride Scheduler

• 

  This is the result of our code showing the best recommendation car that fit our plan.

Inspiration

Waiting for rides can be frustrating when cars arrive too early or too late. Inspired by apps like Metro Flex, we wanted to create a system that predicts car arrival times and automatically recommends the best ride while minimizing customer wait time.

What it does

Smart Ride Scheduler simulates a fleet of cars with random locations and speeds. It calculates estimated arrival times (ETA) for each car, lists all cars meeting the customer’s minimum wait time, recommends the optimal car, and automatically reroutes to a closer car if the recommended one is delayed.

How we built it

We built it as a Java console application using object oriented programming. Each car is an object with coordinates and speed, and the app calculates distance and ETA using simple math formulas. Logic for filtering cars, recommending the best ride, and smart rerouting was implemented in Java.

Challenges we ran into

Simulating realistic ETA calculations for multiple cars with random positions and speeds. Filtering cars and choosing the optimal ride efficiently. Implementing dynamic rerouting when the recommended car is delayed.

Accomplishments that we're proud of

Created a functional smart ride scheduler that mimics real-world apps like Metro Flex. Successfully implemented filtering, recommendation, and rerouting logic. Built a console app ready for hackathon demonstration.

What we learned

Applied object-oriented programming and Java fundamentals. Learned to calculate distance and time dynamically using math. Developed logical decision-making for selecting and rerouting rides efficiently.

What's next for Smart Ride Scheduler

Add real time car location updates and support for multiple customers. Build a GUI interface for easier interaction. Integrate real map APIs (e.g., Google Maps) for accurate distance and ETA. Enhance rerouting logic to handle multiple simultaneous rides.

Built With

• java