论文标题
一种新的方法来解决K-Center问题的地理位置
A Novel Approach to Solve K-Center Problems with Geographical Placement
论文作者
论文摘要
设施位置问题是物流中众所周知的挑战，被证明是NP-HARD。在本文中，我们专门模拟了设施的地理位置，以为客户提供足够的服务。确定合理的中心位置是管理层的重要挑战，因为它直接影响未来的服务成本。通常，目标是放置中央节点，以便所有客户都可以方便地访问它们。我们分析问题并比较不同的位置策略并评估所需中心的数量。我们使用几种现有方法，并提出一种新的启发式方法。对于我们的实验，我们考虑各种情况并采用模拟来评估优化算法的性能。我们的新优化方法显示出重大改进。提出的结果通常适用于许多领域，例如，军事基地的放置，内容交付网络的计划或仓库的放置。
The facility location problem is a well-known challenge in logistics that is proven to be NP-hard. In this paper we specifically simulate the geographical placement of facilities to provide adequate service to customers. Determining reasonable center locations is an important challenge for a management since it directly effects future service costs. Generally, the objective is to place the central nodes such that all customers have convenient access to them. We analyze the problem and compare different placement strategies and evaluate the number of required centers. We use several existing approaches and propose a new heuristic for the problem. For our experiments we consider various scenarios and employ simulation to evaluate the performance of the optimization algorithms. Our new optimization approach shows a significant improvement. The presented results are generally applicable to many domains, e.g., the placement of military bases, the planning of content delivery networks, or the placement of warehouses.
