• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.317-326
• /
• 2007

We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3480-3500
• /
• 2017

Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.194-200
• /
• 2009

This study provides a heuristic algorithm to solve the locating problem of repair service centers (RSCs). To enhance the customer service level with more satisfaction and quicker responsiveness, the locating problem of RSCs has become one of the important issues in reverse supply chain management. This problem is formulated as a zero-one mixed integer programming in which an exiting distributor will be considered to be an un-capacitated repair service center for the objective of cost-minimizing. Since logistical costs are highly interrelated with the multinational location of distributors and RSCs, the fixed cost for setting a repair service center, variable cost, transportation cost, and exchange rates are considered in this study. Recognizing the selection of un-capacitated RSCs' locations is a combinatorial optimization problem and is a zero-one mixed integer programming with NP-hard complexity, we provide a heuristic algorithm named as incremental cost matrix procedure (ICMP) to simplify the solving procedure. By using the concise and structural cost matrix, ICMP can efficiently screen the potential location with cost advantage and effectively decide which distributor should be a RSC. Results obtained from the numerical experiments conducted in small scale problem have shown the fact that ICMP is an effective and efficient heuristic algorithm for solving the RSCs locating problem. In the future, using the extended ICMP to solve problems with larger industrial scale or problems with congestion effects caused by the variation of customer demand and the restriction of the RSC capacity is worth a further investigation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.569-576
• /
• 2007

This paper is on the enhancement of our heuristics for GOSST problem that could apply to the design of communication networks offering graduated services. This problem hewn as one of NP-Hard problems finds a network topology meeting the G-Condition with minimum construction cost. In our prior research, we proposed two heuristics. We suggest methods of selecting G-Node and disconnections for Global or Local locating heuristic in this research. The ameliorated Local locating heuristic retrenches 17% more network construction cost saving ratio and the reformed Global locating heuristic does 14% more than our primitives.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.200-207
• /
• 2007

The passive direction finding cross localization method is widely adopted in passive tracking, therefore there will exist masses of false intersection points. Eliminating these false intersection points correctly and quickly is a key technique in passive localization. A new method is proposed for passive locating and tracking multi-jammer target in this paper. It not only solves the difficulty of determining the number of targets when masses of false intersection points existing, but also solves the initialization problem of elastic network. Thus this method solves the problem of multi-jammer target correlation and the elimination of static false intersection points. The method which dynamically establishes multiple hypothesis trajectory trees solves the problem of eliminating the remaining false intersection points. Simulation results show that computational burden of the method is lower, the elastic network can more quickly find all or most of the targets and have a more probability of locking the real targets. This method can eliminate more false intersection points.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7A
• /
• pp.654-661
• /
• 2011

RTLS (Real-time locating systems) are used for tracking the location of people or assets in real time. In this system, RTLS readers continuously communicate with RTLS tags for measuring time or ranges and location engine tries to calculate accurate location of tags. However, when we attempt to apply this system to real world, the non-line-of-sight(NLOS) problem can be critical to the system performance because of the obstacles. In this paper, we suggest a new location estimation method for an NLOS environment using a reader-selection strategy. We have implemented all components of the locating system and carried out experiments in a test-bed. The accuracy of the system is 50% better than that of the existing general locating system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.310-317
• /
• 2013

In this paper an ESPRIT-based super-resolution time delay estimation algorithm is developed for real-time locating system (RTLS) and its performance is analyzed in various multipath environments. The performance of the existing correlation method for time delay estimation seriously degrades in multipath environments where the relative time delays of multipath signals are less than a PN chip. To solve the problem we shall develop a frequency domain super-resolution time delay estimation algorithm using the ESPRIT, the most representative super-resolution direction-of-arrival (DOA) estimation algorithm, and analyze its performance in various multipath environments.

• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.45-66
• /
• 2008

Refuse collection, one of important elements in reverse logistics, is an activity rendering recyclables or wastes and moving them to some points where further treatment is required. Among various decisions in the collection activity, we focus on network design, which is the problem of locating collection points as well as allocating refuses at demand points to collection points while satisfying the capacity restriction at each collection point. Here, the collection point is the place where recyclables or wastes near the point are gathered, and locating the collection points is done by selecting them from a given set of potential sites. The objective is to minimize the sum of fixed costs to open collection points and transportation costs to move refuses from demand points to collection points. An integer programming model is developed to represent the problem mathematically and due to the complexity of the problem, two types of heuristics, one with simultaneous and the others with separate location and allocation, are suggested. Computational experiments were done on test problems up to 500 potential sites, and the results are reported. In particular, some heuristics gave near optimal solutions for small-size test problems, i.e., 2% gaps in average from the optimal solution values.

• Structural Engineering and Mechanics
• /
• v.27 no.5
• /
• pp.625-638
• /
• 2007

The damage detection process may appear difficult to be implemented for truss structures because not all degrees of freedom in the numerical model can be experimentally measured. In this context, the damage locating vector (DLV) method, introduced by Bernal (2002), is a useful approach because it is effective when operating with an arbitrary number of sensors, a truncated modal basis and multiple damage scenarios, while keeping the calculation in a low level. In addition, the present paper also evaluates the noise influence on the accuracy of the DLV method. In order to verify the DLV behavior under different damages intensities and, mainly, in presence of measurement noise, a parametric study had been carried out. Different excitations as well as damage scenarios are numerically tested in a continuous Warren truss structure subjected to five noise levels with a set of limited measurement sensors. Besides this, it is proposed another way to determine the damage locating vectors in the DLV procedure. The idea is to contribute with an alternative option to solve the problem with a more widespread algebraic method. The original formulation via singular value decomposition (SVD) is replaced by a common solution of an eigenvector-eigenvalue problem. The final results show that the DLV method, enhanced with the alternative solution proposed in this paper, was able to correctly locate the damaged bars, using an output-only system identification procedure, even considering small intensities of damage and moderate noise levels.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.473-476
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location.