This work addresses a subject in the ridesharing area, which consists of drivers offering rides to others and filling the spaces that would be normally empty in their vehicles. In our approach, a person that offers a ride does not need to pass at the origin point of the passenger but just at a point close enough of it. This way, we have an approach closer to what happens in practice. The big number of vehicles in the streets is one of the biggest problems in brazilian cities. Ridesharing, which has shown itself as a way to reduce the impact of this problem, is a subject widely discussed in the academic community nowadays. However, to the best of our knowledge, few papers includes the characteristic of close attendance like we use in our work. In this paper, we formalize the problem defining their characteristics and propose an Integer Linear Programming (ILP) formulation to model the problem. We present heuristic and exact approaches to solve it. Finally, we elaborate a technique, which combine a greedy constructive heuristic and the ILP model providing satisfactory results for most part of the proposed instances, better than when each one were performed individually. Cases with large practical application were tested in the context of Viçosa, Minas Gerais, where thousands of people leave their homes having as destination the Federal University of Viçosa. The technique have been tested to consider a context with single and multiple destinations and were validated using a large number of instances with different features, including real data instances.
Ridematching for a common destination with close enough attendance
01.11.2016
2040056 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Solving the ridematching problem in dynamic ridesharing
TIBKAT | 2013
|A Statistical Model for Dynamic Ridematching on the World Wide Web
British Library Conference Proceedings | 1999
|Smart Traveler Automated Ridematching Service Lessons Learned for Future ATIS Initiatives
British Library Conference Proceedings | 1996
|Transportation Research Record | 2013
|