• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.2
• /
• pp.36-41
• /
• 1987

This paper presents a heuristic algorithm for solving the simple facility location problem. Its main procedure is essentially of 'add' type, which progressively selects facilities to open according to a certain criterion derived from the analysis of the linear programming dual. Computational experience with test problem from the literature is presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.7 no.2
• /
• pp.19-26
• /
• 1981

A special case of the probabilistic multi-location problem is studied in a two-echelon logistic system for deteriorating items. The objective is to determine the location of the minimum number of supply centers among a discrete set of location sites of supply centers, such that the probability each retailer being covered by some supply center is not less than a specified value. A logistic cost is introduced as performance measure of the system, and leads us to analyze the impact of deterioration rate on the location problem. The results obtained from numerical examples are discussed, which provides effective guidelines that can be used for the logistic managerial decisions.

• 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 Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.191-194
• /
• 2003

Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.2
• /
• pp.175-181
• /
• 2014

Location awareness is one of the key functions to build an U-city. Recently, many of works for the location-aware systems are emerging to be applied to on-going large-scale apartment complex. For example, when dwellers or cars with active tags are move in the apartment complex, the active tags broadcast their own identifiers periodically and receivers such that routers use this information to calculate the location of the active tags. Since the active tags can actually move between routers and coordinators, it requires a hand-off mechanism. In this paper, we investigate the hand-off problem occurred in location awareness system based on ZigBee active tags. We propose and analyze a new approach for handling the hand-off problem. Through a mathematical analysis, we show that our approach diminishes the quantity of packet transfer than ZigBee's approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.101-113
• /
• 1995

The past three decades have witnessed a tremendous growth is the literature on location proble. A mathematical formulation of uncapacitated plant location problem and the k-median as an integer program has proven very fruitful in the derivation of solution methods. Most of the successful algorithms for the problem are based on so-called "strong" linear programming relaxation. This is due to the fact that the strong linear programming relaxation provides a tight lower bound. In this paper we investigate the phenomenon with a structural analysis of the problem.e problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.1-9
• /
• 2011

This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1984

This paper considers the intermediate warehouse location problem in a two stage distribution system where commodities are delivered from the given set of capacitated factories to customers via uncapacitated intermediate warehouses. In order to determine the subset of warehouses to open which minimizes the total distribution costs including the fixed costs associated with opening warehouses, the cross decomposition method for mixed integer programming recently developed by T.J. Van Roy is used. The cross decomposition unifies Benders decomposition and Lagrangean relaxation into a single framework that involves successive solutions to a primal subproblem and a dual subproblem. In our problem model, primal subproblem turns out to be a transshipment problem and dual subproblem turns out to be an intermediate warehouse location problem with uncapacitated factories.

• International Journal of Contents
• /
• v.10 no.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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.2
• /
• pp.63-68
• /
• 2009

The location of mobile terminals in cellular networks is an important problem in the field of information technology with applications in resource allocation, location sensitive browsing, and emergency communications. Finding location estimation techniques that are robust to non-line of light (NLOS) propagation is a key problem in this area. Time of arrival (TOA) and pattern matching (PM) measurements can be made simultaneously by CDMA cellular networks at low cost. The different sources of errors for each measurement type cause TOA and PM measurements to contain independent information about mobile station (MS) locations. This paper combines the information of PM and TOA measurements to calculate a superior location estimate. The proposed location estimator is robust, provides lower error than the estimators based on the individual measurements, and has low implementation costs.