• 경영과학
• /
• 제26권1호
• /
• pp.197-208
• /
• 2009

In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.

• International Journal of Contents
• /
• 제10권4호
• /
• pp.69-74
• /
• 2014

General location aware systems are only applied to indoor and outdoor environments using more than three transmitters to estimate a fixed object location. Those kinds of systems have environmental restrictions that require an already established infrastructure. To solve this problem, an Object Location Estimation (OLE) algorithm based on PTP (Point To Point) communication has been proposed. However, the problem with this method is that deduction of performance parameters is not enough and location estimation is very difficult because of unknown restriction conditions. From experimental tests in this research, we determined that the performance parameters for restriction conditions are a maximum transmission distance of CSS communication and an optimum moving distance interval between personal locations. In this paper, a system applied OLE algorithm based on PTP communication is implemented using a CSS (Chirp Spread Spectrum) communication module. A maximum transmission distance for CSS communication and an optimum moving distance interval between personal locations are then deducted and studied to estimate a fixed object location for generalization.

• 한국경영과학회지
• /
• 제37권4호
• /
• pp.197-209
• /
• 2012

This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

• 산업경영시스템학회지
• /
• 제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.

• 대한인간공학회지
• /
• 제6권1호
• /
• pp.33-40
• /
• 1987

To study the body trunk basic to Clothing construction, and study the peculiarities of visual spatial division, necessary items are measured indirectly from 216 unmarried women from 19 to 24 years old by a photographic net-work method. In so doing, the problem of Fashion Design in establishing the location of Darts for Basic Dress is not considered. The following results are obtained. 1) Indirect measuring method, is obtained approximate to actual size, with an error of .+-. 2.8cm. 2) In the modeling plan of Dart location viewed from the visual-spatial division in Basic Dress, it is concluded that Darts are to be placed at the point of 1/3k+1/5k form the waist. From the aesthetic point of wiew, it is more appealling for darts to be placed at the point of 6cm .+-. 0.6cm right or left of center. 3) From direct measurement dart location can be set based on bust point width, and from indirect measurement, dart location can be set based on waist width.

• Communications for Statistical Applications and Methods
• /
• 제6권2호
• /
• pp.467-478
• /
• 1999

This paper deals with the problem of change-point estimation where there is one level change in location with iid errors. A change-point estimator using rank average is proposed with the proof of its consistency. A comparison study of various change-point estimators is done by simulation on the mean the proportion and the variance when the errors are from the normal and the double exponential distributions.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.353-359
• /
• 2003

This paper deals with the problem of testing mean change with one change-point with the normal random variables. We propose a test with the mean difference for change in a location parameter. A power comparison study of various change-point test statistics is performed via Monte Carlo simulation with S-plus software.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.129-133
• /
• 2004

Studies on the optimal location of retail store have been made in case of no obstacle(Minagawa etal. 1999). This paper deals with the location problem of retail store considering obstacles (e.g. rivers, railways, highways, etc.) and obstacle-overcoming points (e.g. bridges, railway crossings, zebra crossings, overpasses, etc.). We assume that (1) commercial goods dealt here are typically convenience goods, (2) the population is granted as potential demand, (3) the apparent demand is a function of the maximum migration length and the distance from the store to customers, (4) the scale of a store is same in every place and (5) there is no competitor. First, we construct the basic model of customers' behavior considering obstacles and obstacle-overcoming points. Analyzing the two dimensional model, the arbitrary force attracting customers is represented as a height of a cone where the retail store is located on the center. Second, we formulate the total demand of customers and determine the optimal location that maximizes the total demand. Finally, the properties of the optimal location are investigated by simulation.

• Journal of Positioning, Navigation, and Timing
• /
• 제11권4호
• /
• pp.369-379
• /
• 2022

In weighted k-nearest neighbor (WkNN)-based Fingerprinting positioning step, a process of comparing the requested positioning signal with signal information for each reference point stored in the fingerprint DB is performed. At this time, the higher the number of matched base station identifiers, the higher the possibility that the terminal exists in the corresponding location, and in fact, an additional weight is added to the location in proportion to the number of matching base stations. On the other hand, if the matching number of base stations is small, the selected candidate reference point has high dependence on the similarity value of the signal. But one problem arises here. The positioning signal can be compared with the repeater signal in the signal information stored on the DB, and the corresponding reference point can be selected as a candidate location. The selected reference point is likely to be an outlier, and if a certain weight is applied to the corresponding location, the error of the estimated location information increases. In order to solve this problem, this paper proposes a WkNN technique including an outlier removal function. To this end, it is first determined whether the repeater signal is included in the DB information of the matched base station. If the reference point for the repeater signal is selected as the candidate position, the reference position corresponding to the outlier is removed based on the clustering technique. The performance of the proposed technique is verified through data acquired in Seocho 1 and 2 dongs in Seoul.