NetworkOptimizationProblems.pptVIP

Chapter 7. Network Optimization Problems 获奖实例 法国国家铁路网每年运载约5000万乘客 通过网络最优化问题来适应乘客的喜好，并且调整日运行量来满足需求 每年增加收入1500万美元，降低成本的同时提高了服务质量 获得了1997年度弗兰茨.厄德曼一等奖 Table of Contents (主要内容) Minimum-Cost Flow Problems (Section 7.1)(最小费用流问题) A Case Study: The BMZ Maximum Flow Problem (Section 7.2)(案例研究：BMZ公司的最大流问题) Maximum Flow Problems (Section 7.3)(最大流问题) Table of Contents (主要内容) Shortest Path Problems: Littletown Fire Department (Section 7.4)(最短路问题：里特城的消防队问题) Shortest Path Problems: General Characteristics (Section 7.4)(最短路问题：一般特征) Shortest Path Problems: Minimizing Sarah’s Total Cost (Section 7.4)(最短路问题：最小化莎拉的总成本问题) Table of Contents (主要内容) Shortest Path Problems: Minimizing Quick’s Total Time (Section 7.4)(最短路问题：最小化奎克公司总时间问题) Minimum Spanning Trees: The Modern Corp. Problem (Section 7.5)(最小支撑树问题：摩登公司问题) Distribution Unlimited Co. Problem The Distribution Unlimited Co. has two factories producing a product that needs to be shipped to two warehouses (无限配送公司有两个工厂生产产品，这些产品需要运到两个仓库里) Factory 1 produces 80 units. (工厂1生产80个单位) Factory 2 produces 70 units. (工厂2生产70个单位) Distribution Unlimited Co. Problem Warehouse 1 needs 60 units. (仓库1需要60个单位) Warehouse 2 needs 90 units. (仓库2需要90个单位) There are rail links directly from Factory 1 to Warehouse 1 and Factory 2 to Warehouse 2. (在工厂1和仓库1之间以及工厂2和仓库2之间各有一条铁路运输轨道) Distribution Unlimited Co. Problem Independent truckers are available to ship up to 50 units from each factory to the distribution center, and then 50 units from the distribution center to each warehouse. (卡车司机至多可以从工厂运输50个单位到配送中心，然后可以从配送中心运输50个单位到仓库) The Distribution Network Data for Distribution Network A Network Model Distribution Unlimited Co. Problem The Optimal Solution Terminology for Minimum-Cost Flow Problems The model for any minimum-cost flow problem is represented by a network with flow passing through it. (所有最小费用流问题都是用带有通过其中的流的网络表示的) The circles in the network are called nodes. (网络中的圆圈被称为节点) Terminology for Minimum-Cost Flow Problems Each node where the net amount of flow gen