• 대한산업공학회지
• /
• 제34권2호
• /
• pp.151-159
• /
• 2008

An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).

• 경영과학
• /
• 제29권1호
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.

• 경영과학
• /
• 제25권2호
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.

• 한국지형학회지
• /
• 제27권4호
• /
• pp.89-112
• /
• 2020

The purpose of this study is as follows: First, we restore the optimal topographical environment of the Bronze Age settlements in the Yongdu Stream and its surrounding area in Asan City. Second, we reveal the relative importance of the topographical factors that the Bronze Age people considered when selecting their dwelling locations. We compared and analyzed topographical factors (ridge scale, ridge direction, slope direction of the ridge, micro-landform of the ridge, position of the ridge) from the ridge's environmental perspective of 123 Bronze Age dwellings (hereinafter referred to as dwellings) found in the survey area for that purpose. The results are as follows: First, from a macro perspective, the optimal topographical environment for the location of the Bronze Age settlement is the second ridge that have the E-W direction. And from a micro perspective, it is the southeast direction slope of the Crest slope at the summit. Second, it appears that the Bronze Age people have taken important consideration in determining the location of their dwelling in the following order: ① position (eg. summit), ② micro-landform (eg. Crest slope, Upper slope), ③ slope direction (eg. southward, South, Southeast), ④ scale (eg. sub-ridge, secondary, tertiary), ⑤ direction (eg. E-W, NNE-SSE).

• 한국물환경학회지
• /
• 제24권2호
• /
• pp.180-184
• /
• 2008

A distributed hydrologic model of an urban drainage area on Bugok drainage area in Oncheon stream was developed and combined with a optimization method to determine the optimal location and number of best management practices (BMPs) for storm water runoff reduction. This model is based on the SCS-CN method and integrated with a distributed hydrologic network model of the drainage area using system of 4,211 hydrologic response units (HRUs). Optimal location is found by locating HRU combination that leads to a maximum reduction in peak flow at the drainage outlet in this model. The results of this study indicate the optimal locations and numbers of BMPs, however, for more exact application of this model, project cost and SCS-CN reduction rate of structural facilities such infiltration trench and pervious pavement will have to be considered.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• 산업경영시스템학회지
• /
• 제5권7호
• /
• pp.9-15
• /
• 1982

The rectilinear-distance location problem combines the property of being a very appropriate distance measure for a large number of location problems and the property of being very simple to treat analytically. An obvious question to be asked at the optimal point which is obtained by the rectilinear distance method is, "what if the point is not available as a location site\ulcorner." The point may, for example, be inaccessible or may coincide with the location of another structure, a river, or a municipal park. In this case, one approach that may be employed is to construct contour lines (also called iso-cost or level curves) of the cost function. Contour lines provide considerable insight into the shape of the surface of the total cost function as well as a useful means of evaluating alternative locations for the new facility. But, when there is an obstacle which divides the application area into two. The optimal location(which is acquired by the rectilinear distance method) is not coincide with the minimal cost point and the contour line is occasionally of no use, this paper shows the method of finding a way to decide an optimal point of single facility location in this case.this case.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2008년도 정기학술발표대회 논문집
• /
• pp.790-793
• /
• 2008

현재, 국토해양부 건설기술혁신사업의 일환으로 2006년 말부터 토공자동화를 위한 '지능형굴삭시스템개발'이 진행되고 있다. 지능형 굴삭시스템의 세부핵심요소기술 중, Task Planning System(TPS)은 토공 작업의 효율성, 안전성, 경제성 등을 고려하여 토공 설계데이터와 작업환경 인식기술에 근거한 작업환경 데이터를 분석하여 최적의 작업계획을 수립하는 시스템이다. 작업계획생성 시 효율적인 토공작업을 위해서는 플랫폼 생성 시 그 위치가 최적의 점을 형성하여 중첩되는 작업영역의 크기가 줄어들어 비효율적인 작업을 제거할 수 있으며 작업 시간을 최소화할 수 있고 굴삭작업의 생산성을 극대화찰 수 있다. 또한, 최적 플랫폼 위치 선정 시 굴삭기 제원에 따른 최적화가 되어야 굴삭기의 규격에 따른 로컬 영역의 산출 알고리즘과 호환이 될 수 있다. 본 논문은 영역 분할 과정에서 산출된 로컬영역을 기준으로 굴삭기 제원에 따른 최적화된 플랫폼 위치 선정 방안에 대하여 살펴보고 검증을 통하여 효율성을 판단하고자 한다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.119-126
• /
• 2004

Location management is very important issue in wireless communication system to trace mobile users' exact location. In this study, we propose a dynamic location area management scheme which determines the size of dynamic location area considering each user's characteristic. In determining the optimal location area size, we consider the measurement data as well as the historical data, which contains call arrival rate and average speed of each mobile user. In this mixture of data, the weight of historical data is derived by linear searching method which guarantees the minimal cost of location management. We also introduce the regularity index which can be calculated by using the autocorrelation of historical data itself. Statistical validation shows that the regularity index is the same as the weight of measurement data. As a result, the regularity index is utilized to incorporate the historical data into the measurement data. By applying the proposed scheme, the location management cost is shown to decrease. Numerical examples illustrate such an aspect of the proposed scheme.

• 한국인터넷방송통신학회논문지
• /
• 제12권2호
• /
• pp.135-143
• /
• 2012

요본 논문은 혈액의 총 배송비용 최소화와 배송 허용시간 $T^*$ 조건을 만족시키는 최적의 물류센터 위치를 결정하는 알고리즘을 제안하였다. Zhang과 Yang은 각 지역에서 최대 거리에 위치한 2개 지점의 평균값이 배송제약시간보다 작은 지점의 위치를 이동시키는 방법을 제안하였으나 최단거리 계산 오류로 인해 물류센터 위치를 잘못 선정하였다. 제안된 알고리즘은 지역 간 최단거리 $l_{ij}$를 구하여 $_{max}l_{ij}{\leq}L^*$인 지점과 $l_{ij}>L^*$인 경로 $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$에 대해 ($v_i,v_k$)와 ($v_j,v_l$)로 $l_{ij}-L^*$ 위치를 이동시킨 지점들 중에서 $_{max}l_{ij}{\leq}L^*$인 지점들을 최종 후보 물류센터 위치로 결정하였다. 이들 후보 지점들 중 총 배송비용이 최소가 되는 지점을 최적의 물류센터 지점으로 결정하였다.