Location Problem for Ambulances Using a Multi-speed Traffic Network Data

• Inakawa Keisuke

  Nanzan University

• Furuta Takehiro

  Nanzan University

• Suzuki Atsuo

  Nanzan University

Bibliographic Information

Other Title

• 複数の速度を持つ道路網データを利用した救急車の配置問題について
• フクスウ ノ ソクド オ モツ ドウロモウ データ オ リヨウ シタ キュウキュウシャ ノ ハイチ モンダイ ニ ツイテ

Abstract

We consider location problems of ambulances. For the problems, we construct a traffic road network. The network contains two types of roads. They are major streets and the other roads. We assume that the speeds of ambulances are different in these two types of roads. We obtain the speeds by an iterative method. Using the network, we give a framework for evaluating ambulance systems by the continuous-time Markov chain method in the meaning of expected response time. We introduce two computational experiments for the ambulance system of Seto city. The first is a comparison with the results of our previous research. We obtain different optimal locations. This is because of using the traffic network. The second is a variation of our previous research. Locations of 4-medians are added to the candidates of the optimal locations. By comparing to the median problem, we discuss the effect of stochastic features in ambulance systems.

Journal

• Journal of the City Planning Institute of Japan

  Journal of the City Planning Institute of Japan 41.3 (0), 259-264, 2006-10-25

  The City Planning Institute of Japan

Keywords

• facility planning
• public service
• Markov process

Details

• CRID: 1390564237992525952
• NII Article ID: 130007411375
• NII Article ID: 10018315018
• NII Book ID: AN10276504
• DOI: 10.11361/journalcpij.41.3.259
• ISSN: 21850593
• ISSN: 09160647
• NDL BIB ID: 8567742
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I8567742
• Web Site: https://www.jstage.jst.go.jp/article/journalcpij/41.3/0/41.3_259/_pdf
• Text Lang: ja
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed