• Title/Summary/Keyword: GIS Allocation Algorithm

Search Result 9, Processing Time 0.023 seconds

A Sensor Node Allocation System Using Propagation Characteristic Experiment and GIS (전파특성실험과 GIS를 이용한 센서노드배치시스템)

  • Kang, Jin-A;Kwon, Hyuk-Jong;Bae, Myung-Nam;Woo, Je-Yoon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.14 no.4
    • /
    • pp.150-160
    • /
    • 2011
  • IT convergence and integration technology aims to create new synergies by combining IT related technology and performance. This study conducted a basic research for combining construction and IT technology to create new synergies. Specifically, the purpose of this study is to combine USN and GIS technology and then apply it to urban facilities management. For this, we have developed the USN hardware, tested propagation communications, and made the GIS Algorithm and a system. Existing sensor node allocation method is mostly to install in a random way or with in-situ survey, but the problem with this method is contradictory to cost effectiveness and efficiency. To solve this problem, we developed a new method for sensor allocation. Using this method, the USN technology could be applied in the range of city unit. This technology can be applied to the ubiquitous urban development such as U-City and Smart City.

System Theory Approach for Decision Making of GIS-based Optimum Allocation (GIS기반 최적공간선정을 위한 시스템론적 접근)

  • Oh, Sang-Young
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.121-127
    • /
    • 2006
  • As information technologies are improving, geographical information system (GIS) technologies are also developing rapidly and demands for spatial analysis with GIS are increasing. Particularly, the spatial analyses with GIS researches have been noted rather than general GIS researches. However, most GIS researches focus on space dimension: a density-based clustering method (DBSCAN) or a DBSCAN algorithm using region expressed as Weight (DBSCAN-W) but the importance of rational decision making based on time dimension has been neglected. This study adopts system dynamics in order to put time dimension in GIS-based optimum allocation.

  • PDF

A Study on the Optimal Allocation for Intelligence Assets Using MGIS and Genetic Algorithm (MGIS 및 유전자 알고리즘을 활용한 정보자산 최적배치에 관한 연구)

  • Kim, Younghwa;Kim, Suhwan
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.4
    • /
    • pp.396-407
    • /
    • 2015
  • The literature about intelligence assets allocation focused on mainly single or partial assets such as TOD and GSR. Thus, it is limited in application to the actual environment of operating various assets. In addition, field units have generally vulnerabilities because of depending on qualitative analysis. Therefore, we need a methodology to ensure the validity and reliability of intelligence asset allocation. In this study, detection probability was generated using digital geospatial data in MGIS (Military Geographic Information System) and simulation logic of BCTP (Battle Commander Training Programs) in the R.O.K army. Then, the optimal allocation mathematical model applied concept of simultaneous integrated management, which was developed based on the partial set covering model. Also, the proposed GA (Genetic Algorithm) provided superior results compared to the mathematical model. Consequently, this study will support effectively decision making by the commander by offering the best alternatives for optimal allocation within a reasonable time.

A GIS-based Geometric Method for Solving the Competitive Location Problem in Discrete Space (이산적 입지 공간의 경쟁적 입지 문제를 해결하기 위한 GIS 기반 기하학적 방법론 연구)

  • Lee, Gun-Hak
    • Journal of the Korean Geographical Society
    • /
    • v.46 no.3
    • /
    • pp.366-381
    • /
    • 2011
  • A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

Development of a Spatial Location-Allocation Model of Center Villages (I) - Development and Verification of Model - (농촌중심마을의 공간적 입지-배분 모형의 개발(I) - 모형의 개발 및 검증 -)

  • 김대식;정하우
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.43 no.2
    • /
    • pp.112-121
    • /
    • 2001
  • In this study, a spatial location-allocation model of center villages (SLAMCV) was developed for selecting spatial center villages and allocating their rear villages. In SLAMCV, rural space was considered as a network with villages for nodes and roads for connecting lines. For quantification of residents’ accessibilities in the network, a disutility index (DUI) was developed and used, which is dependent upon travelling distance between the center and its hinter villages, design vehicle speed in connecting road and population of hinter villages. SLAMCV was verified to Christaller’s hexagonal hierachical settlement system to test the theoretical reasonability and computing algorithm of the model.

  • PDF

A Strict Hub Network Design with Single Allocation for Road Freight Transportation (도로화물수송의 단일할당 제약 허브네트워크 설계)

  • Kim, Nam-Ju;Kim, Yong-Jin
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.2
    • /
    • pp.91-100
    • /
    • 2011
  • Hub network design for freight transportation is a decision process that determines hub locations together with freight transportation routes among shippers so as to ultimately minimize total logistics cost. This study presents the optimal location of hubs by strict hub network design policy with single allocation, which overcomes the limitation of Kim et al. (2008) that does not allow direct transportation among shippers. The greedy-interchange algorithm is employed for hub location decision process, and EMME/2 is adopted for the route searching process. Application of the processes to the nationwide highway network shows that the best hub locations in order are Seoul metropolitan, GyeongNam, Chung-nam, Jeon-Nam, Gyeong-Buk, Chung-Buk, and the locations are concentrated on the Seoul-Busan corridor. The strict hubnetwork design policy with single allocation increases the transportation distance but decreases the transportation cost by passing through the hubs instead of direct transportation. The reduction in total transportation cost can be achieved as the number of hubs increases, but the amount of the reduction gradually decreases because the cost reduction from the decrease in detour transportation distance between non-hubs and hubs becomes less than the discount reduction from dispersion of inter-hubs transportation volumes.

(Task Creation and Allocation for Static Load Balancing in Parallel Spatial Join (병렬 공간 조인 시 정적 부하 균등화를 위한 작업 생성 및 할당 방법)

  • Park, Yun-Phil;Yeom, Keun-Hyuk
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.418-429
    • /
    • 2001
  • Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

  • PDF

Suggestion for Spatialization of Environmental Planning Using Spatial Optimization Model (공간최적화 모델을 활용한 환경계획의 공간화 방안)

  • Yoon, Eun-Joo;Lee, Dong-Kun;Heo, Han-Kyul;Sung, Hyun-Chan
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.21 no.2
    • /
    • pp.27-38
    • /
    • 2018
  • Environmental planning includes resource allocation and spatial planning process for the conservation and management of environment. Because the spatialization of the environmental planning is not specifically addressed in the relevant statutes, it actually depends on the qualitative methodology such as expert judgement. The results of the qualitative methodology have the advantage that the accumulated knowledge and intuition of the experts can be utilized. However, it is difficult to objectively judge whether it is enough to solve the original problem or whether it is the best of the possible scenarios. Therefore, this study proposed a methodology to quantitatively and objectively spatialize various environmental planning. At first, we suggested a quantitative spatial planning model based on an optimization algorithm. Secondly, we applied this model to two kinds of environmental planning and discussed about the model performance to present the applicability. Since the models were developed based on conceptual study site, there was a limitation in showing possibility of practical use. However, we expected that this study can contribute to the fields related to environmental planning by suggesting flexible and novel methodology.

A Location Model and Algorithm for Visiting Health-care Districting for the Rural Elderly (농촌지역 노년인구를 위한 방문 의료서비스 구역 설정 모델 및 알고리즘)

  • Kim, Kam-Young;Shin, Jung-Yeop;Lee, Gun-Hak;Cho, Dae-Heon
    • Journal of the Korean Geographical Society
    • /
    • v.44 no.6
    • /
    • pp.813-832
    • /
    • 2009
  • As accessibility to health-care service in less populated rural areas is geographically limited and demand for public health-care by the aging is increasing, a new approach for health-care service such as a home care service is becoming more popular. For a home care service, health-care personnels directly visit to location of health-care clients. Such changes in provision of health services require developing innovative and scientific approaches for efficient allocation of health resources and managing services by public health-care organizations. The purpose of this study is to formulate a location model for visiting health-care districting for the rural elderly and to develop an Automated Zoning Procedure (AZP) to solve this model. Mobility, workload balance and contiguity criteria are considered in the model. Three different objective functions are evaluated; 1) minimizing the sum of network distance between the unit areas in a district, 2) maximizing spatial interaction between the unit areas in a district, and 3) minimizing tour distance that visits each unit area exactly once in a district. The AZP for solving the model is developed and applied to a rural area. The application results demonstrate that the AZP can generate different districting systems for each objective functions.