Forum for Science, Industry and Business

Sponsored by:     3M 
Search our Site:

 

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

02.09.2014

A new analytic framework enables analysis of GPS data on 150 million cab rides in New York City

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 carbon dioxide emissions?

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.

"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.

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 real time, 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.

###

Written by Larry Hardesty, MIT News Office

Andrew Carleen | Eurek Alert!
Further information:
http://www.mit.edu

Further reports about: GPS MIT Ride-sharing Telematics algorithm cellphone dioxide emissions reduction

More articles from Studies and Analyses:

nachricht Tracking Down the Causes of Alzheimer’s
03.09.2015 | Universität Basel

nachricht Pathways to Deep Decarbonization in Germany
02.09.2015 | Wuppertal Institut für Klima, Umwelt, Energie GmbH

All articles from Studies and Analyses >>>

The most recent press releases about innovation >>>

Die letzten 5 Focus-News des innovations-reports im Überblick:

Im Focus: Fraunhofer ISE Develops Highly Compact Inverter for Uninterruptible Power Supplies

Silicon Carbide Components Enable Efficiency of 98.7 percent

Researchers at the Fraunhofer Institute for Solar Energy Systems ISE have developed a highly compact and efficient inverter for use in uninterruptible power...

Im Focus: How wind sculpted Earth's largest dust deposit

China's Loess Plateau was formed by wind alternately depositing dust or removing dust over the last 2.6 million years, according to a new report from University of Arizona geoscientists. The study is the first to explain how the steep-fronted plateau formed.

China's Loess Plateau was formed by wind alternately depositing dust or removing dust over the last 2.6 million years, according to a new report from...

Im Focus: An engineered surface unsticks sticky water droplets

The leaves of the lotus flower, and other natural surfaces that repel water and dirt, have been the model for many types of engineered liquid-repelling surfaces. As slippery as these surfaces are, however, tiny water droplets still stick to them. Now, Penn State researchers have developed nano/micro-textured, highly slippery surfaces able to outperform these naturally inspired coatings, particularly when the water is a vapor or tiny droplets.

Enhancing the mobility of liquid droplets on rough surfaces could improve condensation heat transfer for power-plant heat exchangers, create more efficient...

Im Focus: Increasingly severe disturbances weaken world's temperate forests

Longer, more severe, and hotter droughts and a myriad of other threats, including diseases and more extensive and severe wildfires, are threatening to transform some of the world's temperate forests, a new study published in Science has found. Without informed management, some forests could convert to shrublands or grasslands within the coming decades.

"While we have been trying to manage for resilience of 20th century conditions, we realize now that we must prepare for transformations and attempt to ease...

Im Focus: OU astrophysicist and collaborators find supermassive black holes in quasar nearest Earth

A University of Oklahoma astrophysicist and his Chinese collaborator have found two supermassive black holes in Markarian 231, the nearest quasar to Earth, using observations from NASA's Hubble Space Telescope.

The discovery of two supermassive black holes--one larger one and a second, smaller one--are evidence of a binary black hole and suggests that supermassive...

All Focus news of the innovation-report >>>

Anzeige

Anzeige

Event News

Together - Work - Experience

03.09.2015 | Event News

Networking conference in Heidelberg for outstanding mathematicians and computer scientists

20.08.2015 | Event News

Scientists meet in Münster for the world’s largest Chitin und Chitosan Conference

20.08.2015 | Event News

 
Latest News

Lighter with Laser Welding

03.09.2015 | Process Engineering

For 2-D boron, it's all about that base

03.09.2015 | Materials Sciences

Phagraphene, a 'relative' of graphene, discovered

03.09.2015 | Materials Sciences

VideoLinks
B2B-VideoLinks
More VideoLinks >>>