Transportation, Assignment and Transshipment problems：运输，分配和转运问题.pptVIP

下载本文档

33
0
约8.9千字
约 65页
2021-07-02 发布于湖北
举报
版权申诉

Transportation, Assignment and Transshipment problems：运输，分配和转运问题.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Chapter 7Transportation, Assignment and Transshipment Problems to accompanyIntroduction to Mathematical Programming: Operations Research, Volume 14th edition, by Wayne L. Winston and Munirpallam Venkataramanan;Description;7.1 Formulating Transportation Problems;Transportation tableau;Table 1. Shipping costs, Supply, and Demand for Powerco Example;Solution;2. Objective function;3. Supply Constraints;4. Demand Constraints;5. Sign Constraints;LP Formulation of Powerco’s Problem;General Description of a Transportation Problem;Xij = number of units shipped from supply point i to demand point j ;Balanced Transportation Problem;Balancing a TP if total supply exceeds total demand;Balancing a transportation problem if total supply is less than total demand;7.2 Finding Basic Feasible Solution for TP;Methods to find the bfs for a balanced TP;1. Northwest Corner Method;According to the explanations in the previous slide we can set x11=3 (meaning demand of demand point 1 is satisfied by supply point 1).;After we check the east and south cells, we saw that we can go east (meaning supply point 1 still has capacity to fulfill some demand).;After applying the same procedure, we saw that we can go south this time (meaning demand point 2 needs more supply by supply point 2).;Finally, we will have the following bfs, which is: x11=3, x12=2, x22=3, x23=2, x24=1, x34=2;2. Minimum Cost Method;After that, as in the Northwest Corner Method we should cross out row i or column j and reduce the supply or demand of the noncrossed-out row or column by the value of Xij. Then we will choose the cell with the minimum cost of shipping from the cells that do not lie in a crossed-out row or column and we will repeat the procedure.;An example for Minimum Cost MethodStep 1: Select the cell with minimum cost.;Step 2: Cross-out column 2;Step 3: Find the new cell with minimum shipping cost and cross-out row 2;Step 4: Find the new cell with minimum shipping cost and cross-out row 1;Step 5: Find the new