• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.7
• /
• pp.710-718
• /
• 2009

The time difference of arrival(TDOA) algorithm is being used widely for identifying the location of a source emanating either electrical or acoustic signal. It's application areas will not be limited to identifying the source at a fixed location, for example the origin of an earthquake, but will also include the trajectory monitoring for a moving source equipped with a GPS sensor. Most of the TDOA algorithm uses time correlation technique to find the time delay between received signals, and therefore difficult to be used for identifying the location of multiple sources. In this paper a TDOA algorithm based on cross-spectrum is developed to find the trajectory of two sound sources with different frequencies. Although its application is limited to for the sources on a disk plane, it can be applied for identifying the locations of more than two sources simultaneously.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.137-144
• /
• 2003

We consider Two-echelon Single source Capacitated Facility Location Problem (TSCFLP). TSCFLP is a variant or Capacitated Facility Location Problem (CFLP). which has been an important issue in boa academic and industrial aspects. Given a set or possible facility locations in two echelons (warehouse / plant), a set or customers, TSCFLP is a decision problem to find a set or facility locations to open and to determine an allocation schedule that satisfies the demands or the customers and the capacity constraints or the facilities, while minimizing the overall cost. It ran be shown that TSCFLP Is strongly NP-hard For TSCFLf, few algorithms are known. which are heuristics. We propose a disaggregated version or the standard mixed integer programming formulation or TSCFLP We also provide a class or valid Inequalities Branch-and-price algorithm with rutting plane method Is used to find an optimal solution Efficient branching strategy compatible with subproblem optimization problems Is also provided. We report computational results or tests on 15 randomly generated instances.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.160-171
• /
• 2008

MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.339-345
• /
• 2012

This research aims to formulate a mathematical model and develop an algorithm for solving a location problem in emergency medical service vehicle parking. To find an optimal parking location which has the least risk score or risk priority number calculated from severity, occurrence, detection, and distance from parking location for emergency patients, data were collected from Pratoom sub-district Disaster Prevention and Mitigation Center from October 2010 to April 2011. The criteria of risk evaluation were modified from Automotive Industry Action Group's criteria. An adaptive simulated annealing algorithm with multiple cooling schedules called multi-agent simulated quenching (MASQ) is proposed for solving the problem in two schemes of algorithms including dual agent and triple agent quenching. The result showed that the solution obtained from both scheme of MASQ was better than the traditional solution. The best locations obtained from MASQ-dual agent quenching scheme was nodes #5 and #133. The risk score was reduced 61% from 6,022 to 2,371 points.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.25-28
• /
• 1999

Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.93-106
• /
• 2004

This paper studied a maximal covering location problem with cost restrictions, to maximize level of service within predetermined cost. It is assumed that all demand have to be met. If the demand node is located within a given range, then its demand is assumed to be covered, but if it is not, then its demand is assumed to be uncovered. An uncovered demand is received a service but at an unsatisfactory level. The objective function is to maximize the sum of covered demand, Two heuristics based on the Lagrangean relaxation of allocation and decoupling are presented and tested. Upper bounds are found through a subgradient optimization and lower bounds are by a cutting algorithm suggested in this paper. The cutting algorithm enables the Lagrangean relaxation to be proceeded continually by allowing infeasible solution temporarily when the feasible solution is not easy to find through iterations. The performances are evaluated through computational experiments. It is shown that both heuristics are able to find the optimal solution in a relatively short computational time for the most instances, and that decoupling relaxation outperformed allocation relaxation.

• Journal of the Korean Institute of Educational Facilities
• /
• v.11 no.1
• /
• pp.25-37
• /
• 2004

This study is derived from a problem for the blind, how to recognize the space and how to find their way. Unlike ordinary people, the disabled people are closely related with special constructor environment using the other sense. Especially, to find his/her location, each person depends on the wayfinding ability as acquiring specific and various information,(e.g. recognizing figure by tactile sense, space size by auditory sense, direction by light from a window and regular noise, and existence of switch in a specific place.) Those senses help the person's wayfinding to his/her destination. The procedure of wayfinding are location, position, orientation, navigation, and movement. Consequently, construction for the people above mentioned can offer a design-guideline considering following factors, building arrangement considering regular noise, refurbishment, plan configuration of floor and wall-skin changed, circulation stream that maintains right angle by the regular noise in the building, enforcement location character by the inflow of the light into a crossing.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.04a
• /
• pp.483-489
• /
• 2009

The Time Difference of Arrival (TDOA) algorithm is being used widely for identifying the location of a source emanating either electrical or acoustic signal. It's application areas will not be limited to identifying the source at a fixed location, for example the origin of an earthquake, but will also include the trajectory monitoring for a moving source equipped with a GPS sensor. Most of the TDOA algorithm uses time correlation technique to find the time delay between received signals, and therefore difficult to be used for identifying the location of multiple sources. In this paper a TDOA algorithm based on cross-spectrum is developed to find the trajectory of two sound sources with different frequencies. Although its application is limited to for the sources on a disk plane, but it can be applied for identifying the locations of more than two sources simultaneously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.1162-1179
• /
• 2017

In this paper, we propose indoor location tracking method using RSSI(Received Signal Strength Indicator) value received from BLE(Bluetooth Low Energy) beacon. Due to the influence of various external environmental factors, it is very difficult to improve the accuracy in indoor location tracking. In order to solve this problem, we propose a novel method of reducing the noise generated in the external environment by using a double Gaussian filter. In addition, the value of the RSSI signal generated in the BLE beacon is different for each device. In this study, we propose a method to allocate additional weights in order to compensate the intensity of signal generated in each device. This makes it possible to improve the accuracy of indoor location tracking using beacons. The experiment results show that the proposed method effectively decrease the RSSI deviation and increase location accuracy. In order to verify the usefulness of this study, we compared the Kalman filter algorithm which is widely used in signal processing. We further performed additional experiments for application area for indoor location service and find that the proposed scheme is useful for BLE-based indoor location service.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.1-4
• /
• 2012

Given separated points divided by a line, called a wall, in a plane, we aim to make a gate in the wall to connect the separated points to each other. In this setting, the problem is to find a location for the gate that minimizes the average distance between the points. The problem is a variant of the well-known facility location problem, which is extensively studied in the fields of operations research, location theory, theoretical computer science, and so on. In this paper, we consider the $L^1$-distance of the points in the plane. The points are projected onto the wall and so the problem is transformed to a proximity problem of points on a line. Then it is shown that the transformed problem is related to the weighted median problem of points on the line. Therefore, we obtain an O(n log n)-time algorithm to solve our problem.