Journey planning in public transportation networks

US8494771B2 · kind B2 · utility

Assignee

• Microsoft Corporation · US

Inventors

• Daniel Delling · Mountain View, US
• Andrew V. Goldberg · Redwood City, US
• Thomas Pajor · Mountain View, US
• Renato F. Werneck · San Francisco, US

Key dates

• Filing date: Sep 7, 2011
• Grant date: Jul 23, 2013
• Expiry date: Nov 28, 2031

Classification

• Technology area (CPC G): Physics
• CPC primary: G06Q50/14
• WIPO field: IT methods for management
• WIPO sector: Electrical engineering

Abstract

Optimum journeys in public transportation networks are determined. The determination of Pareto optimal journeys from one stop to another stop in a public transportation network uses the criteria travel time and minimum transfers. A technique for bi-criteria journey planning using the aforementioned criteria in public transportation networks operates in rounds (K rounds at most), where after round k (k≦K), arrival times are computed for the stops that can be reached with up to k trips.