Mixed integer linear programming formulation for the taxi sharing problem

3Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a group of people traveling from the same origin to multiple destinations, the Taxi Sharing Problem consists in assigning taxis to each person such that the total cost spent by the group of people is minimized. This problem arises in the context of Smart Mobility, where the resources of a city must be optimized to save costs and pollution while the mobility services are improved for the citizens. We propose a mixed integer linear programming formulation as an accurate way to solve the problem of taxi sharing. We empirically analyze our formulation solving different real-like instances of the problem with 9 to 69 people.

Cite

CITATION STYLE

APA

Ben-Smida, H. E., Krichen, S., Chicano, F., & Alba, E. (2016). Mixed integer linear programming formulation for the taxi sharing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9704, pp. 106–117). Springer Verlag. https://doi.org/10.1007/978-3-319-39595-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free