Finding the Shortest Route between Two Points in a Network | Zendy

Tony Nicholson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finding the Shortest Route between Two Points in a Network

Author(s) -

Tony Nicholson

Publication year - 1966

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/9.3.275

Subject(s) - computer science , selection (genetic algorithm) , mathematical optimization , point (geometry) , shortest path problem , scheduling (production processes) , algorithm , theoretical computer science , mathematics , artificial intelligence , graph , geometry

A new method is proposed for finding the shortest route between two points in an interconnected network. The shortest route is found by investigating a selection of routes from both the starting point and the terminal point. The selection of routes is decided dynamically by extending one by one the routes which have currently covered the least distance. Once a complete through route has been found, it has to be made certain that it is the minimum. The new method appears to be more efficient than alternative approaches to the problem through linear or dynamic programming. Some applications of the technique to scheduling and other problems are briefly described.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research