运筹学hapter6.docVIP

Chapter 6 Network Models Situations: P213 Natural gas pipeline network (Minimal sparring tree) Network of road (Shortest-route algorithm) Coal shurry pipeline network (Maximum flow algorithm) Minimum-cost flow schedule of a pipeline network (Minimum-cost capacitated network algorithm) Time schedule of a construction project (Critical path (CPM) algorithm) Network Definitions nodes Network (N , A) Figure.6.1 arcs/branches node ~ Weight arc ~ Flow: fij Capacity: cij fij≤cij Directed Oriented Arc: positive flow in one direction o flow in the opposite direction Directed Network…… Path : a sequence of distinct arcs ……regardless of the direction of flow in each arc. Directed Path: …… Cycle : path connecting a node to itself Directed Cycle / Loop Connected Network : every two distinct nodes are linked by at least one path Tree : a connected network that may involve only a subset of all the nodes of the network with no cycles allowed; Spanning Tree : subset =Set! 6.2 Minimal Spanning Tree Algorithm. Example.1 (P216) 6.3 Shortest-Route Problem 6.3.1 Examples of the Shortest-Route Algorithm Example 1 (Equipment Replacement) Figure 6.9 (P221) Example 2 (Most Reliable Rate) Figure 6.11 (P222) “Log” Example 3 (Three-Jug Puzzle) Figure 6.12 (P223) “Node””Are” 6.3.2 Shortest-Route Algorithm: Ⅰ) Dijkstrai’s Algorithm: Source dij≥0 every-other-node ui —— shortest distance from node 1 to node i dij —— length of are(i,j) Label: [uj,i] temporary: permanent: Step1. the starting node (source): P[0,-] Every other node T[∞,-] set i=1 Step2. T[uj,k] If ui+dijuj the modify [ui+dij,i] T Step3. For all nodes T labeled [ut,st] Ur=min{ ut } T P [ur,sr] Set i=r step 2.