Ride-sharing could cut cabs' road time by 30 percent

Sep 01, 2014 by Larry Hardesty
Screenshot of HubCab showing taxi flows and potential taxi-sharing benefits between two locations in Manhattan. Credit: HubCab, MIT Senseable City Lab.

Cellphone apps that find users car rides in real time are exploding in popularity: The car-service company Uber was recently valued at $18 billion, and even as it faces legal wrangles, a number of companies that provide similar services with licensed taxi cabs have sprung up.

What if the taxi-service app on your cellphone had a button on it that let you indicate that you were willing to share a ride with another passenger? How drastically could cab-sharing reduce traffic, fares, and ?

Authoritatively answering that question requires analyzing huge volumes of data, which hasn't been computationally feasible with traditional methods. But in today's issue of the Proceedings of the National Academies of Sciences, researchers at MIT, Cornell University, and the Italian National Research Council's Institute for Informatics and Telematics present a new technique that enabled them to exhaustively analyze 150 million trip records collected from more than 13,000 New York City cabs over the course of a year.

Their conclusions: If passengers had been willing to tolerate no more than five minutes in delays per trip, almost 95 percent of the trips could have been shared. The optimal combination of trips would have reduced total travel time by 40 percent, with corresponding reductions in operational costs and carbon dioxide emissions.

"Of course, nobody should ever be forced to share a vehicle," says Carlo Ratti, professor of the practice in MIT's Department of Urban Studies and Planning (DUSP) and one of the paper's coauthors. "However, our research shows what would happen if people have sharing as an option. This is more than a theoretical exercise, with services such as Uber Pool bringing these ideas into practice."

Finding the optimal combination of trips does require foreknowledge of trips' starting times: For instance, a 30-minute trip the length of Manhattan might be combined with a 10-minute trip beginning 15 minutes later. But that kind of advance planning is unlikely if the passengers are using cellphone apps. So the researchers also analyzed the data on the assumption that only trips starting within a minute of each other could be combined. Even then, they still found a 32 percent reduction in total travel time.

Shareability networks translate spatiotemporal sharing problems into a graph-theoretic framework that provides efficient solutions. Credit: Paolo Santi and Michael Szell.

"We think that with the potential of a 30 percent reduction in operational costs, there is plenty of room for redistributing these benefits to customers, because we have to offer them lower fares; to drivers, because we have to incentivize them to belong to this system; to companies; and of course, there is a benefit for the community," says Paolo Santi, a visiting scientist in DUSP and first author on the paper.

In fact, Santi says, the results of his and his colleagues' analysis were so striking that they asked Cornell mathematician Steven Strogatz to review their methodology. Strogatz is a co-author on the paper, as are Ratti and postdoc Stanislav Sobolevsky, both of MIT's Senseable City Lab. Rounding out the author list are Michael Szell, who was a postdoc in the Senseable City lab when the work was done and is now at Northeastern University, and Giovanni Resta, a researcher at Santi's home institution, the Institute for Informatics and Telematics.

Screenshot of HubCab showing pickups and dropoffs of 150 million taxi trips over one year in New York City. Credit: HubCab, MIT Senseable City.

In analyzing taxi data for ride-sharing opportunities, "Typically, the approach that was taken was a variation of the so-called 'traveling-salesman problem,'" Santi explains. "This is the basic algorithmic framework, and then there are extensions for sharing."

The traveling-salesman problem asks whether, given a set of cities and the travel times between them, there is a route that would allow a traveling salesman to reach all of them within some time limit. Unfortunately, the traveling-salesman problem is also an example—indeed, perhaps the most famous example—of an NP-complete problem, meaning that even for moderate-sized data sets, it can't (as far as anyone knows) be solved in a reasonable amount of time.

So Santi and his colleagues took a different approach. First, they characterize every taxi trip according to four measurements: the time and GPS coordinates of both the pickup and the dropoff. Then, for each trip, their algorithm identifies the set of other trips that overlap with it—the ones that begin before it ends. Then it determines whether the trip they're examining can be combined with any of those other trips without exceeding the delay threshold. On average, any given trip is "shareable" with about 100 other trips.

Next, the algorithm represents the shareability of all 150 million trips in the database as a graph. A graph is a mathematical abstraction consisting of nodes—usually depicted as circles—and edges—usually depicted as lines between nodes. In this case, the nodes represent trips and the edges represent their shareability.

The graphical representation itself was the key to the researchers' analysis. With that in hand, well-known algorithms can efficiently find the optimal matchings to either maximize sharing or minimize travel time.

The researchers also conducted experiments to ensure that their matching algorithm would work in , if it ran on a server used to coordinate data from cellphones running a taxi-sharing app. They found that, even running on a single Linux box, it could find optimal matchings for about 100,000 trips in a tenth of a second, whereas the GPS data indicated that on average, about 300 new taxi trips were initiated in New York every minute.

Finally, an online application designed by Szell, HubCab, allows people to explore the taxi data themselves, using a map of New York as an interface.

Explore further: Indonesian capital threatens to ban Uber car app

More information: "Quantifying the benefits of vehicle pooling with shareability networks," by Paolo Santi et al. PNAS, www.pnas.org/cgi/doi/10.1073/pnas.1403657111

add to favorites email to friend print save as pdf

Related Stories

Indonesian capital threatens to ban Uber car app

Aug 20, 2014

The Indonesian capital is threatening to shut down controversial smartphone car-hailing service Uber due to licensing issues a week after it officially launched in the city, an official said Wednesday.

Commuting times stay constant even as distances change

Jun 16, 2014

How much commuting can you tolerate? A new study by MIT researchers shows that across countries, people assess their commutes by the time it takes them to complete the trip, generally independent of the distance ...

Berlin taxi drivers hail city's Uber ban

Aug 14, 2014

Berlin taxi drivers were celebrating Thursday after authorities banned the ridesharing service Uber from operating in the city because of safety concerns.

Uber taxi app seeks capital at $12 bn value

May 23, 2014

Uber, the startup app that connects people with taxis and drivers, is seeking to raise fresh capital that would give it a $12 billion value, the Wall Street Journal reported Friday.

3Qs: Uber's on the move

Jul 15, 2014

In just five years Uber, a startup ride-sharing company based in San Francisco, has become a popular form of transportation in 100 cities around the world. Using a mobile app, passengers connect with drivers ...

Recommended for you

Brain inspired data engineering

10 hours ago

What if next-generation ICT systems could be based on the brain's structure and its cognitive and adaptive processes? A groundbreaking paradigm of brain-inspired intelligent ICT architectures is being born.

Forging a photo is easy, but how do you spot a fake?

Nov 21, 2014

Faking photographs is not a new phenomenon. The Cottingley Fairies seemed convincing to some in 1917, just as the images recently broadcast on Russian television, purporting to be satellite images showin ...

User comments : 1

Adjust slider to filter visible comments by rank

Display comments: newest first

AJW
not rated yet Sep 02, 2014
Many small towns already have this system working as "Dial-a-ride" bus.

"Their conclusions: If passengers had been willing to tolerate no more than five minutes in delays per trip, almost 95 percent of the trips could have been shared."

What percentage of taxi riders are willing to share? Of those willing to share what percentage are willing to be delayed? Can you retract your willingness to share? Retract it based on appearance?

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.