Limitations of network flow algorithms in river basin modeling.
Limitations of network flow algorithms in river basin modeling.
复制标题
流域建模中网络流算法的局限性。
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Nesa Ilich
中科院分区：
文献类型：
--
作者：
Nesa Ilich
自1970年代中期以来，各机构开发了一些用于河流流域规划和管理的计算机模型，并得到广泛使用。大多数早期的发展都是基于使用启发式权重因子来表示分配的优先级，以及基于使用网络流算法（NFA）的专门优化算法。虽然这些算法一开始比标准单纯形求解器快得多，但它们对流约束的处理过于简单，最终导致使用迭代方案来处理非网络约束。本文严格审查的概念，迭代结合NFA是一个很好的车辆处理非网络约束。失败证明了一个简单的问题，两个水库串联的几个变种。
A number of computer models for river basin planning and management have been developed by various agencies and used extensively since the mid-1970s. Most of the early developments have been based on the use of heuristic weight factors to represent priorities of allocation, and specialized optimization algorithms that were based on the use of network flow algorithms (NFAs). While these algorithms were at first considerably faster than the standard Simplex solvers, their handling of flow constraints was simplistic, which eventually led to the use of iterative schemes for handling nonnetwork constraints. This paper critically examines the notion that iterations applied in combination with NFA are a good vehicle for handling nonnetwork constraints. The failures are demonstrated on several variants of a simple problem with two reservoirs in series.