Britannica Sources used in this answer

How does network routing find a route with the lowest time, cost, or distance?

Created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

optimization problem — optimization Constraint set bounded by the five lines x₁ = 0, x₂ = 0, x₁ = 8, x₂ = 5, and x₁ + x₂ = 10. These enclose an infinite number of points that represent feasible solutions.

In the field of operations research, network routing involves finding an optimal path between nodes—points connected by links—by minimizing total time, cost, or distance. These links are characterized by specific values, and finding the best route often requires navigating constraints, such as visiting each node only once.1

To solve these problems, both graphic and analytic procedures are employed. A foundational method is the Dijkstra algorithm, developed by computer scientist Edsger Dijkstra. This graph-theory solution determines the shortest path between two nodes and remains a standard tool for routing in communication networks and flight planning.12

For more complex scenarios, such as the traveling salesman problem—where one must visit every node exactly once and return to the origin with minimal cost—the computational complexity increases significantly. While exact solutions are difficult for large networks, researchers utilize approximating procedures to find efficient, if not perfectly optimal, routes.1