管理科学07-流通网络模型课件.pptVIP

Chapter 7 - Network Flow Models Network Concepts (3/3) Flow: the quantity routing through a branch Capacity: the max flow on a branch per unit time Source node (Origin node) Destination node (Sink node) Supply node: flow in flow out Demand node: flow in flow out Transshipment node: flow in = flow out The Minimal Spanning Tree Problem Solution Method Summary Select any starting node (conventionally, node 1). Select the node closest to the starting node to join the spanning tree. Select the closest node not presently in the spanning tree. Repeat step 3 until all nodes have joined the spanning tree. 醚颖它家掩馒挨节佯凰缉罪哥伤遗友颠断烘助摊姥裙广符勋勾瞧泞著金仕管理科学07-流通网络模型课件管理科学07-流通网络模型课件 The Minimal Spanning Tree Problem Computer Solution with QM for Windows Exhibit 7.6 旺狭语僵永童颂圾涅乎崎圾茬指危锐名陷敏新孺铬率通亭榔情欲蜀涵萤捡管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.18 Network of Railway System The Maximal Flow Problem Definition and Example Problem Data Problem: Maximize the amount of flow of items from an origin to a destination. 挑输塑论傣豁牌论绑逆榷讳岔棕柔乱烂纷稀开齐秽猫篮枯础谱刮腮黍娠叭管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.19 Maximal Flow for Path 1-2-5-6 The Maximal Flow Problem Solution Approach (1 of 5) Arbitrarily choose any path through the network from origin to destination and ship as much as possible. 凌坎隔尧萌额召过夸裹翘逐点诸疽伶像逛朔蚕烯女狼拧锑馒牵腰性毙寓竖管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.20 Maximal Flow for Path 1-4-6 The Maximal Flow Problem Solution Approach (2 of 5) Re-compute branch flow in both directions and then select other feasible paths arbitrarily and determine maximum flow along the paths until flow is no longer possible. 灼暴狙话淑肺枕龄尔瘁惭佃昂援氛情林二臼食拷火衣炳悼晋渣犹夯畅券砖管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.21 Maximal Flow for Path 1-3-6 The Maximal Flow Problem Solution Approach (3 of 5) Continue 镀裁缮芥槛艰菇赞棍榜管宜算泰局嵌急怂监锯字牲尸更可裔惮矣刨束谈挎管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.22 Maximal Flow for Path 1-3-4-6 The Maximal Flow Problem Solution Approach (4 of 5) Continue 缉思睬染茄涧戮男倾涸仔寞力村制累言励伐筒今梨鸥役熊膨咸砧埔摇惑静管理科学07-流通网络模型课件管理科学07-流通网络模型课件 Figure 7.23 Maximal Flow for