• Journal of the Korea Safety Management & Science
• /
• v.15 no.1
• /
• pp.77-85
• /
• 2013

In the location science, environmental effect becomes a new main consideration for site selection. For the unwanted facility location selection, decision makers should consider the cost of resolving the environmental conflict. We introduced the negative influence cost for the facility which was inversely proportional to distance between the facility and residents. An unwanted facility location problem was suggested to minimize the sum of the negative influence cost and the transportation cost. The objective cost function was analyzed as nonlinear type and was neither convex nor concave. Three GRASP (Greedy Randomized adaptive Search Procedure) methods as like Random_GRASP, Epsilon_GRASP and GRID_GRASP were developed to solve the unwanted facility location problem. The Newton's method for nonlinear optimization problem was used for local search in GRASP. Experimental results showed that quality of solution of the GRID_GRASP was better than those of Random_GRASP and Epsilon_GRASP. The calculation time of Random_GRASP and Epsilon_GRASP were faster than that of Grid_GRASP.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.33-47
• /
• 1998

The facility location problem considered here is to determine facility location sites under future's uncertain demand. The objective of this paper is to propose a solution method and algorithm for a two-stage stochastic facility location problem. utilizing the Benders decomposition method. As a two-stage stochastic facility location problem is a large-scale and complex to solve, it is usually attempted to use a mean value problem rather than using a stochastic problem. Thus, the other objective is to study the relative error of objective function values between a stochastic problem and a mean value problem. The simulation result shows that the relative error of objective function values between two problems is relatively small, when a feasibility constraint is added to a facility location model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.663-665
• /
• 1998

This paper investigates a facility location problem where there are possible demand points with demand occuring probabilites and actual distances between these points and the facility site to be determined are ambiguous, Further we define the fuzzy goal with respect to the maximum value among the actual distances between demand points and the facility. We determine the site of facility maximizing the minimal satisficing degree under the chance constraint. We propose the geometric algorithm to find this optimal site.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.23-35
• /
• 1990

A mathematical model for a dynamic capacitate facility location problem is formulated by a mixed integer problem. The objective of the model is to minimize total discounted costs that include fixed charges and distributed costs. The Cross Decomposition method of Van Roy is extended and applied to solve the dynamic capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework. It successively solves a transportation problem and a dynamic uncapacitated facility location problem as two subproblems. Computational results are compared with those of general mixed integer programming.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.2
• /
• pp.21-31
• /
• 1986

Consider a capacitated facility location problem in which the demands of customers are all equal and so are the capacities of facilities. Under the restriction that each customer's uniform demand be met by exactly one facility, the objective is to select a set of facilities to open, and to assign customer's demand to them so as to minimize the total cost which includes fixed costs of opening facilities as well as variable assignment costs. The problem is modelled as a pure zero-one program which may be viewed as a variant of well-known capacitated facility location problems. The purpose of this study is to develop efficient computational procedures for solving the pure zero-one facility location problems. Due to the special structure of our zero-one location problem with uniform demand, it can be converted to a location problem with the unimodular property. A Lagrangean relaxation algorithm is developed to solve the location problem. The algorithm is made efficient by employing a device which exploits the special structure of a surrogate constraint. The efficiency of the algorithm is analyzed through computational experiments with some test problems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.209-214
• /
• 2018

This paper suggests simple algorithm of facility location problem in perishable commodities that satisfy with minimum total transportation cost and within the transportation time constraint $L^*$. For this problem, Lee[4] suggests very complex algorithm that decides candidate facility locations, computes total transportation cost for each candidate facility location, then moving the location to optimal location for top two facilities. On the other hand, this paper simply determines the candidate facility locations within $L^*$ using subtree concept, and decides optimal minimal total transportation cost for top two locations in centralized area of required quantity using neighborhood concept.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.139-155
• /
• 2006

The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.51-59
• /
• 2021

In this paper, we propose a location-based service that the user's location is known by connection history to WI-FI AP installed in a facility known its location previously. The location-based service proposed in this paper manages job processing states of technicians who inspect and maintain the facility like elevator by using worker's location and arrival time information. The job scheduling management method proposed in this paper is based on previously scheduled arrival time and actual arrival time to a target facility. And we experimentally implemented the inspection and maintenance system of an elevator to show the feasibility of job schedule management based on location and arrival time information acquired from Wi-Fi AP connection history. Our experimental implementation shows that our proposed method is usefulness in the field of the inspection and maintenance of a facility.

• Journal of Platform Technology
• /
• v.10 no.1
• /
• pp.11-19
• /
• 2022

In this paper, we propose a location-based service that the user's location is known by connection history to WI-FI AP installed in a facility known its location previously. The location-based service proposed in this paper manages job processing states of technicians who inspect and maintain the facility like elevator by using worker's location and arrival time information. The job scheduling management method proposed in this paper is based on previously scheduled arrival time and actual arrival time to a target facility. And we experimentally implemented the inspection and maintenance system of an elevator to show the feasibility of job schedule management based on location and arrival time information acquired from Wi-Fi AP connection history. Our experimental implementation shows that our proposed method is usefulness in the field of the inspection and maintenance of a facility.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.