![]() ![]() Now, Christian Wulff-Nilsen of the University of Copenhagen's Department of Computer Science has succeeded in cracking the nut along with two colleagues. For 40 years, researchers have been working to find an algorithm that can optimally solve this mathematical conundrum. The software being used is trying to solve a variant for the classic algorithmic "shortest path" problem, the shortest path in a dynamic network. People probably don't think about the complicated math behind routing suggestions in these types of situations. A more complicated variant of the problem is when the route traverses a changing network- whether this be a road network or the internet. ![]() One of the most classic algorithmic problems deals with calculating the shortest path between two points. Now, computer scientist Christian Wulff-Nilsen of the University of Copenhagen and two research colleagues have come up with a recipe. because a queue has formed due to roadworks or an accident.įor 40 years, an algorithm has been sought to provide an optimal solution to this problem. The best route can suddenly be the slowest, e.g. This is because road networks, public transportation networks and other networks aren't static. ![]() Still, there are times when a proposed route doesn't quite align with reality. ![]() When heading somewhere new, most of us leave it to computer algorithms to help us find the best route, whether by using a car's GPS, or public transport and map apps on their phone. Finding the shortest route from an origin to a destination is the primary concern for any traveller. ![]()
0 Comments
Leave a Reply. |