Reachability Search
Reachability search for perfect planning
Journey planners usually give information about the duration of a journey from one place to another. However, for that start and destination must be defined and therefore known in advance. In order to figure out which locations can be reached in a certain time, HaCon has developed the reachability search. The solution translates time into space – as distances in public transport do not tell much about the travel times.
Multi-dimesional search
The reachability search operates multi-dimensionally: from a starting point, all possible destinations that may be reached within a given time period are computed. In addition, the duration of the trip, products of public transport and the number of transfers as well as private transport can be selected. The reachability search processes queries in real-time and works in a co-modal way. For this, the several modes of transport, as buses, trains, cars, bikes and also walking are shown on a map to compare them at first sight. For calculating car, bike and walking distances, HaCon uses the xRoute Server from PTV.
The algorithm behind the reachability search calculates 50,000 destinations within one second. After entering starting point and desired travel time, the passenger receives all results easily comparable on a map.
Always find the right place
In addition, further data, such as hotels, public institutions, banks, cultural and sports facilities and garages have been integrated. With one click, users retrieve important additional information useful for their planning.




