Journey planner

Developed as a service (native dll). When function is called with coordinates and algorithm parameters it calculates the optimal public transportation routes and returns formatted xml. Data is loaded from SQL server at first call and used from shared memory after that.


  • Itinerary (list of the route events) contains full data including walking parts, stops (stations), changes and drive times.
  • Selectable number of results by following criteria: optimal, least walking between stops or fewest changes
  • Real time traffic data are taken into account during route finding
  • Multilanguage
  • Developed in native C++, uses modified version of A star algorithm (in-house developed). In medium size public transportation system (200 lines and 3000 stops) calculates set of optimal routes in less than 1/2 second. Output is fully formatted xml.

For more information please use form at Contact page.


Post a Comment

Note: Only a member of this blog may post a comment.

Cancel Reply