Feed on
Posts
Comments

Tag Archive 'routing'

Winner of the 2019 Climathon Heidelberg

Over the last few days, Heidelberg’s first climathon event took place at EMBL, which was part of the global Climathon. The event ran from 25th-27th October 2019 with a 24 hour hackathon taking place on the 26th-27th. During the 24 hours developers, entrepreneurs, designers and students came together and worked as teams on 5 innovative [...]

Read Full Post »

We’re happy to announce a new version of our QGIS Plugin ORS Tools. Additionally to the core services of giving easy access to our directions, isochrone and matrix API’s, the plugin now allows users to optimize their trips via a Traveling Salesman service.
The openrouteservice API’s included a Vehicle Routing Optimization Machine since quite a while, [...]

Read Full Post »

We are delighted to invite you to join a workshop on open-source routing with time-dependent restrictions, see http://giscienceblog.uni-hd.de/2019/04/17/project-tardur-starts-open-source-routing-with-time-dependent-restrictions/.
The workshop is taking place on Friday before the State of the Map conference, 20th September 2019 in Heidelberg. It is free of charge and will last from 9:00 to 16:00 with a lunch break in between. Detailed [...]

Read Full Post »

Routing optimization in a humanitarian context
Routing optimization generally solves the Vehicle Routing Problem (a simple example being the more widely known Traveling Salesman Problem). A more complex example would be the distribution of goods by a fleet of multiple vehicles to dozens of locations, where each vehicle has certain time windows in which it can operate and [...]

Read Full Post »

IT IS HOT! So you are looking for a more shady pedestrian route through the urban jungle? You might then prefer some routes that go through public green spaces with trees and bushes. Thank goodness we are working already on such green and also shady routing together with some partners in the mFund project meinGrün. [...]

Read Full Post »

As promised earlier this year, we are very happy to finally announce the unveiling of our new route optimization endpoint!
We deployed an instance of the popular Vroom open-source engine, which is capable of solving complex Vehicle Routing Problems (VRP) in record time. This type of problem always occurs when multiple locations need to be visited in [...]

Read Full Post »

Zeitabhängige Sperrungen und Nutzungsbeschränkungen von Straßen werden bislang in keiner frei verfügbaren Software zur Routenplanung genutzt. In dem im März gestarteten Projekt “TARDUR - Temporal Access Restrictions for Dynamic Ultra-Flexible Routing” gehen die Universität Heidelberg und die Firma GraphHopper dieses Problem an. Das Projekt wird im Rahmen der Förderrichtlinie Modernitätsfonds (”mFUND”) mit insgesamt 100.000 Euro [...]

Read Full Post »

Alle Jahre wieder blühen die Kirschbäume vor unserem Institutsgebäude in voller Pracht und laden Passanten allen Alters ein zum Verweilen. Städtische Grünflächen wie diese leisten einen wichtigen Beitrag zur urbanen Lebensqualität, indem sie viele Funktionen wie Naturerfahrung, sozialen Austausch und Erholung ermöglichen. Jedoch eignet sich nicht jeden Grünfläche gleichermaßen für jeden Einzelnen [...]

Read Full Post »

Time-dependent restrictions and temporal road closures are so far not considered in any freely available software for route planning. Heidelberg University and the company GraphHopper aim to address this issue in their joint project “TARDUR - Temporal Access Restrictions for Dynamic Ultra-Flexible Routing”. The project started in March and is supported by the Federal Ministry [...]

Read Full Post »

A first preview on the new client for Openrouteservice has been released as a public beta. It is available at https://openrouteservice.org/map/ .
Wit the features implemented until now the new map client is already functional. `There are some important functionalities to be implemented yet`, but it is already useful for routing.
It is also important to emphasize [...]

Read Full Post »

Older Posts »