Smart Transportation Based Car Pooling System

. Sharing of car is Carpooling, so that multiple number of people can travel in single car. the use of car pooling reduces single individuals Travelling cost , reduces the fuel cost and reduces the number of cars. Due to the growth in the population there is inadequate transportation through their own car . Rather than using different mode of Transportation. It results in increasing number of Traffic on roads also increases pollution and increases time to travel to there destination. So by Smart transportation using car pooling system the individual can travel and share there rides with different people of a same destination. In this paper we have carried outs survey. By reviewing various Literature papers on carpooling it aims to reduce the number of cars by sharing the rides.


1.Introduction
Due to increasing amount of peoples every single people travel to their Destination alone in their own car. Travelling alone leads to increases individual fuel cost. The carpooling system merges multiple new people in a car which leads to meet new people in a car, reduces air pollution and noise pollution. The carpooling system save economy of every people as they share their rides also share the cost with the other member in car. It will stop endless Spending money in travel.Rather than using public transportation such as local train , buses and metros. The people can conveniently travel to there destination in the comfortably by giving same cost. The carpooling is the best ideas to reduces the traffic jams as it reduces the car on road. Safety is an important aspect in every means, so travelling with the different people is also a prior thing not all the people are comfortable to travel with the unknown people. For example, women are not feeling safe to travel with unknown people. So the carpooling system also provide ride of only woman.

2.RelatedWork
Nusrat et.al. [2] in this paper introduced the Euclidean distance for measuring the nearest vehicle. This system is based on 3 tier architecture where it had client tier, middle tier and database tier. In this system the users location can be tracked by the GPS. And after finding their location the system suggest the nearest vehicle to the users. In this paper for implementing the system the searching algorithm had also been used. This system helps to reduce empty seats of cars.
Fu-shiung et.al. [4] the main intention of this paper is to find the match between passenger and driver. Depending on their trajectories. In this system for solving the car pooling problem heuristic techniques has been applied, this techniques is used for searching and it also used a matching algorithm for allocating passenger to drivers car depending on their trajectories. The system had developed based on mobile platform as well as Google API. Based on matching algorithm and various different techniques the system was used in reduction of distance.
Mena et.al. [5] In this paper Semantic features used for car pooling system is based on the user trips. In this proposed system the two main techniques has been used that is route matching and the other is applied matching algorithm the route matching techniques is used for to find the match between the passenger based on their point of interest. It also apply machine learning cluster algorithm likek-mean and the density based spatial clustering of application with noise (DBSCAN) is applied for optimizing the rank between different match trips.
Raza Hasan et.al. [1] In this paper, author hadproposed the system smart peer car pooling system(SPCPS) for minimizing the number of cars and increasing the parking slot areas by using the linear programming problem it also uses the Dijkstra algorithm for finding shortestpath. In this paper optimal result is obtained from the dijkstra algorithm. The author had proposed the SPCPS system which is beneficial consuming fuel and also helped to improve the socialism.
Mattia et.al. [7] in this paper, it uses two types of techniques to propose carpooling system, first is learning-to-rank which is basically used for ranking model of the individual. Secondly they used learning algorithm in their system. The author proposed GOTOGETHER system which was used for carpooling system which uses machine learning ranking system. The system used twitter and foursquare dataset for the evaluation. Those dataset are used for the evaluation for the pattern and ride requests.
Fu-Shiung et.al. [6]This paper author had formulated the carpooling problems and formulated thier solutions.Using meta heuristic technique to evaluate differential evolution problem. To evaluate integration programming problem with combination of binary decision variable, it is using Differential Evolution technique in this system. Initially carpooling optimisation problem is formulated in the form of integer programming problem and then based on it different variants of differential evolution algorithms had been developed.
Shih-Chia Huang et.al. [7], the author had formulated carpool service problem (CSP). The paper had used Ant colony optimisation (ACO) algorithm, for the carpool service system . The author used ACO algorithm for choosing optimal path between ant colony and food source over graph.

3.Methodology
Car pooling system provides the benefits of sharing rides with different peoples. By surveying different papers, it is found that it uses heuristic searching techniques for searching the cars. By using Euclidean distance techniques, it finds the nearest car that has to be assigned to passenger. It usually uses Global Positioning System(GPS) for finding the locations of cars. In study it is found that, Route matching techniques are used in order to match drivers and passengers locations by using Google maps API , and then based on their route, driver is allocated to passenger. In most of carpooling system, it is observed that the Dijkstra algorithm is used for detecting the shortest route of destination of passenger. Dijkstra algorithm is usually used for detecting the optimal minimum path. It is found that is checks for maximum possibilities and then chooses the minimum route for thejourney.

4.Car Pooling System
After studying the paper[1] [2][3] the generalized car pooling system is highlighted in fig.1. The system shows that, the passenger has to do registration, if already registered than directly has to logged into the system. All the passengers details are stored into the database then. Then passenger needs to enter the pickup and drop locations. If the location of passenger and driver matches, then the driver accepts the ride from the passenger. Security is prior thing in carpooling system. So as soon as the passenger is assigned with driver, the passenger has to share his/her live location, drivers details, car's details, other passenger details(if present) to their contacts. Then driver will check for optimal path. Driver has to accept the request of same destination. Depending upon the availability of seats and drop location, driver has to accept the ride.

Author
Methods Features Observation ACPA with path based structure is achieved.

6.Conclusion
The papers are chosen from the literature is studied in this paper. It is observed that most of the paper uses matching algorithm and Dijkstra algorithm for finding shortest distance. Thus we have discussed Matching algorithm and Dijkstra algorithm in detail. In this paper we have studied that Carpooling system helps in Reducing pollution, Fuel expense, Parking and Tolls. It is observed that there is much scope for the research in the car pooling system for ex. in reducing the time to find the required ride, calculating the minimum distance etc. In this paper we have tried to give reader an idea about complete car pooling process.