icar : Application for Car Pooling Using Bootstrap

Abstract

In today’s world, there are lots of people commuting from place to place. Example: employees going back home. Students going home from university etc. And lot of times, people will be commuting via car or bike and there is place to take a fellow employee along with him to give a ride. But the problem is there is no easy way to know how many people a person can take and co-ordination is a huge issue that there is no effort by people to help each other by giving a lift and more over this saves the environment in reducing fuel usage, reduces traffic with fewer vehicles etc. The Carpool is an android application which will provide the advanced searching techniques and provide most relevant results for the carpooling in the city. icar : Application For Car Pooling Using Bootstrap This will be help full in easy way Carpooling reduces the costs involved in repetitive or long distance driving by sharing cars, sharing rental charges, or paying the main car owner. Some countries have introduced high-occupancy vehicle (HOV) lanes to encourage carpooling and use of public transport, to combat rising traffic congestion

Objectives

Long-term carpooling is defined as the sharing of a private vehicle by several individuals who follow a semi-common route between different points of origin and destination (OD) during a specific period. In practice, a participant can request to share the same trip with his/her friends, in which case they are treated as a participant group with the same OD and travel route/schedule. The results of such an action are the following:

1) Reduction in the number of vehicles on the route;

2) Reduction in expenses for gas;

3) Reduction in energy consumption (CO2 emissions) and Pollution;

4) Provision of social connections in an increasingly Disconnected society.

Purpose of proposed work

The Dynamic Carpooling is more complicated than long-term/daily many-to-one or one-to-many carpooling problems. An efficient plan for the Dynamic Carpooling may require matching participant groups to a car on a semi common route or assigning a participant group to different cars on different days. It is very difficult to simultaneously and optimally determine every participant group’s role (driver group or passenger group), driver group schedules, and passenger group deliveries, as well as to suitably match several participant groups in a car while still keeping in mind fairness considerations. This process involves complicated movements of driver groups (or vehicles) and passenger groups in both time and space, with consideration of driver/passenger traveling costs.