ORTEC
Job description
If you’re a fan of Dijkstra’s, read on! While the famous Dijkstra algorithm is the fastest algorithm for shortest pathfinding in a general graph, in special cases we can do better by relying on assumptions for the input graph. At ORTEC, we repeatedly compute many related shortest paths on a static graph: the road network. For example, when computing a distance matrix to be used to optimize delivery routes for 1000s of customers, we compute millions of pairwise shortest paths. Using clever algorithms, we’re proud to say that we can compute such matrices in just a few seconds!
The challenge
In this project, you will investigate how we can improve our algorithms to consider traffic congestion in shortest path computations. Concretely, when congestion is to be expected (e.g. during peak hours), it could be better to take a different route to avoid it. We would like to compute such time-dependent shortest/fastest paths for any time of the day, for many combinations of origin and destination, all while keeping computation times low. Can you help us make this possible using advanced data structures and algorithms?
Who you are
What we offer
Did we peak your interest? Then upload your CV, motivation letter and grade lists (BSc and MSc in one PDF if applicable). The recruitment process will consist of two online assessments, first interview, and a second interview with a case.
What to expect
We will help you to thrive in your field of expertise. We offer development programs, tailored to your individual needs and function requirements, including opportunities to attend courses and seminars. We offer challenging, practical hands-on experience with opportunities to work abroad. We operate in a flat organizational structure that keeps communication lines short. The atmosphere is open, informal, cooperative and positive.