answersLogoWhite

0


Best Answer

Since you mentioned shortest route, by network analysis I assume that you mean analysing the min and max lengths of a path through a given graph/network. The simplest shortest route algorithm is Dijkstra's algorithm and is as follows:

1. mark all nodes as unvisited, and set total length of each node as infinity, except the initial/starting node which should be marked 0 and current.

2. travel along the current node's shortest adjacent arcto an unvisited node.

3. add the arc's length and the previous node's total length to the current nodes total length, and then mark the current node as current and the previous node as visited.

4. repeat 2 and 3 until you reach your target node.

The algorithm for longest path is the same except in step two you follow the node's longest adjacent arc.

For the linear programming of this visit the related link below this answer.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Network analysis by linear programming and shortest route?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What has the author F P Vasilyev written?

F. P. Vasilyev has written: 'In-depth analysis of linear programming' -- subject(s): Linear programming


Explain the importance of sensitivity analysis with respect to linear programming problem?

f


What has the author Paul R Thie written?

Paul R. Thie has written: 'An introduction to linear programming and game theory' -- subject(s): Linear programming, Game theory 'An Introduction To Analysis'


What do you understand by linear programming?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


What do you understand by linear programming problem?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


What has the author George Bernard Dantzig written?

George Bernard Dantzig has written: 'On the continuity of the minimum set of a continuous function' -- subject(s): Continuous Functions, Functions, Continuous, Mathematical optimization 'The application of decomposition to transportation network analysis' -- subject(s): Mathematical models, Traffic assignment, Transportation 'Linear programming' -- subject(s): Linear programming


Define linear programming?

necessity of linear programming on organization.


What is a linear network?

the network which consist linear elements is known as linear network


What is the significance of duality theory of linear programming Describe the general rules for writing the dual of a linear programming problem?

the significance of duality theory of linear programming


What has the author Robert Arthur Hoppe written?

Robert Arthur Hoppe has written: 'A linear programming analysis of land use planning in the White Pine Planning Unit, St. Joe National Forest, Idaho' -- subject(s): Forest management, Linear programming


What are the essential characteristics of linear programming problem?

essential attributes of linear programming models and its uses


What is the difference between linear and integer programming?

Integer programming is a method of mathematical programming that restricts some or all of the variables to integers. A subset of Integer programming is Linear programming. This is a form of mathematical programming which seeks to find the best outcome in such a way that the requirements are linear relationships.