https://github.com/ramamagarwal/project-carpool_management_system

This repository includes my project on carpool management system in which I used object orientation paradigms and principles using C++.
https://github.com/ramamagarwal/project-carpool_management_system

a-star-algorithm cpp dijkstra-algorithm oops-in-cpp yen-algorithm

Last synced: 3 months ago
JSON representation

This repository includes my project on carpool management system in which I used object orientation paradigms and principles using C++.

• Host: GitHub
• URL: https://github.com/ramamagarwal/project-carpool_management_system
• Owner: RamamAgarwal
• Created: 2024-07-15T10:57:56.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2025-01-12T09:52:46.000Z (5 months ago)
• Last Synced: 2025-02-01T03:32:46.249Z (5 months ago)
• Topics: a-star-algorithm, cpp, dijkstra-algorithm, oops-in-cpp, yen-algorithm
• Language: C++
• Homepage: https://github.com/RamamAgarwal/Project-Carpool_Management_System
• Size: 122 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        

Cab Pooling System for University Students


Problems Generally Faced While Travelling



    
Students often face high cab costs for distant exams or events.

    
Many students travel alone without knowing others going to the same destination and end up spending a lot on cabs.

    
Shuttle services in a college are limited to only certain places and the timings do not coordinate with everyone’s schedule.

    
Wouldn’t it be better if you could share cabs and split the fare with fellow university students?



One-Step Solution

Implementing a cab pooling system for university students.


Approach

Defined a specific format for the people to input their schedules. The format includes all the details like departure time, destination, and contact information (email). Used SQL based databases like MySQL for storing the data.

The C++ program written, using a database, creates a class for user data and schedules. Algorithms, including graph and backtracking, match schedules based on criteria like destination and departure time, optimizing for efficiency are used. Considerations include dropping off passengers, restricting destinations within +-2km, and prioritizing identical destinations using a database search algorithm.

Once the matches are found, the people are notified via an email and contact information for each other about the possibility of sharing a cab. This is achieved by routing the output from the C++ program to an input for a python script, which would use an API service to send out the emails.


Benefits



    


        
Connects students with shared travel routes to save money and reduce travel expenses.

        
Aims to alleviate financial strain and promote a collaborative approach to commuting.

        
Cost-saving: Sharing cab expenses with fellow students.

        
Convenience: Easier travel arrangements, especially for distant destinations.

        
Community building: Encourages collaboration and social interaction among students.

        
Enhancing transportation outside university and improving the university experience for all students.