Chapter 5Transportation, Assignment and Network Models.ppt

Chapter 5Transportation, Assignment and Network Models.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chapter 5Transportation, Assignment and Network Models.ppt

Chapter 5: Transportation, Assignment and Network Models Network Flow Models Consist of a network that can be represented with nodes and arcs Transportation Model Transshipment Model Assignment Model Maximal Flow Model Shortest Path Model Minimal Spanning Tree Model Characteristics of Network Models A node is a specific location An arc connects 2 nodes Arcs can be 1-way or 2-way Types of Nodes Origin nodes Destination nodes Transshipment nodes Decision Variables XAB = amount of flow (or shipment) from node A to node B Flow Balance at Each Node (total inflow) – (total outflow) = Net flow The Transportation Model Decision: How much to ship from each origin to each destination? Objective: Minimize shipping cost Data Decision Variables Xij = number of desks shipped from factory i to warehouse j Objective Function: (in $ of transportation cost) Min 5XDA + 4XDB + 3XDC + 8XEA + 4XEB + 3XEC + 9XFA + 7XFB + 5XFC Subject to the constraints: Flow Balance For Each Supply Node (inflow) - (outflow) = Net flow - (XDA + XDB + XDC) = -100 (Des Moines) OR XDA + XDB + XDC = 100 (Des Moines) Other Supply Nodes XEA + XEB + XEC = 300 (Evansville) XFA + XFB + XFC = 300 (Fort Lauderdale) Flow Balance For Each Demand Node XDA + XEA + XFA = 300 (Albuquerque) XDB + XEB + XFB = 200 (Boston) XDC + XEC + XFC = 200 (Cleveland) Go to File 5-1.xls Unbalanced Transportation Model If (Total Supply) (Total Demand), then for each supply node: (outflow) (supply) If (Total Supply) (Total Demand), then for each demand node: (inflow) (demand) Transportation Models With Max-Min and Min-Max Objectives Max-Min means maximize the smallest decision variable Min-Max mean to minimize the largest decision variable Both reduce the variability among the Xij values Go to File 5-3.xls The Transshipment Model Similar to a transportation model Have “Transshipment” nodes with both inflow and outflow Revised Transportation Cost Data Note: Ev

文档评论(0)

gtez + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档