Designing and Implementing Strategies for Solving Large Location-Allocation Problems with Heuristic Methods (91-10)
Designing and Implementing Strategies for Solving Large Location-Allocation Problems with Heuristic Methods (91-10)
复制标题
设计和实施利用启发式方法解决大型位置分配问题的策略 (91-10)
DOI：
--
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
P. Densham
中科院分区：
文献类型：
--
作者：
P. Densham
位置分配问题的求解技术通常不是基于微计算机的地理处理系统的一部分。要处理和存储的大量数据以及算法的复杂性对在微型计算机环境中实现这些解决方案技术提出了障碍。然而，决策者需要能够真实的实时返回选址问题解决方案的分析系统。我们表明，最准确的启发式，位置分配算法的处理要求，可以大大减少预处理点间距离数据作为候选人和需求字符串，并利用位置分配问题的空间结构，通过更新分配表。因此，解决问题的时间增加近似线性问题的大小。这些发展允许在以微机为基础的交互式决策环境中解决大型问题（3 000个节点）。这些方法在一个微型计算机系统中实现，并对三个网络问题进行了测试，验证了我们的主张。
Solution techniques for location-allocation problems usually are not a part of micro-computer based geo-processing systems. The large volumes of data to process and store and the complexity of algorithms present a barrier to implementation of these solution techniques in a micro-computer environment. Yet decision-makers need analysis systems that return solutions to location selection problems in real time. We show that processing requirements for the most accurate heuristic, location-allocation algorithm can be drastically reduced by pre-processing inter-point distance data as both candidate and demand strings and exploiting the spatial structure of location-allocation problems by updating an allocation table. Consequently, solution times increase approximately linearly with problem size. These developments allow the solution of large problems (3,000 nodes) in a microcomputer-based, interactive decision-making environment. These methods are implemented in a micro-computer system and tests on three network problems validate our claims.