An Approximate Solution of Multi-Weber Problems with Barriers

DOI Web Site Web Site 1 Citations 22 References

Bibliographic Information

Other Title
  • 障害付多点ウェーバー問題の近似解法
  • 障害付多点ウェーバー問題の近似解法--大学キャンパスにおけるAED配置のスタディ
  • ショウガイ ツキ タテン ウェーバー モンダイ ノ キンジカイホウ ダイガク キャンパス ニ オケル AED ハイチ ノ スタディ
  • 大学キャンパスにおけるAED 配置のスタディ
  • Aed Locations in a Campus of University

Search this article

Abstract

This paper shows an approximate solution to Multi-Weber Problems with Barriers. By measuring the shortest-path distances of a random Delaunay network, we provide the method to convert Multi-Weber Problems with Barriers into practical p-median problems on discrete networks. And, we verify that several simple model problems can be solved by this method. Moreover, we solved Automated External Defibrillator's Locations in Komaba Research Campus of the University of Tokyo, as a sample Multi-Weber problem with free-shaped obstacles.

Journal

Citations (1)*help

See more

References(22)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top