• 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 Society of Industrial and Systems Engineering
• /
• v.5 no.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.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.107-116
• /
• 2010

The facility location problem is one of the traditional optimization problems. In this paper, we deal with the single source capacitated facility location problem (SSCFLP) and it is known as an NP-hard problem. Thus, it seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the SSCFLP. This paper introduces a new efficient evolutionary algorithm for the SSCFLP. The proposed algorithm is devised by incorporating a general adaptive link adjustment evolutionary algorithm and three heuristic local search methods. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds optimum solutions at almost all middle size test instances and very stable solutions at larger size test instances.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.7 no.10
• /
• pp.1-16
• /
• 1984

The purpose of this paper is to develop rational layout model for small and medium scale industry in Korea. The methodology of this paper is to light the importance of small and medium scale company. Moreover, to overcome the problem of layout in non-massing jobbing production shop this paper is proposed four techniques. So proposed layout model is obtained analytically in single, multiple facility location problem The result of this paper is as follows : First, alternatives to overcome abnormal layout in small and medium company are 1) GT (Group Technology) 2) SLP (Systematic Layout Planning) 3) OR (Operations Research) 4) Computer Second, in single facility location problem, Gradient method and square weighted average method are studied. Lastly in multiple facility location problem, heuristic method is obtained.

• 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.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.186-193
• /
• 2019

This article compares the weighted geometric median with the centroid, from the question why they use the centroid when they would find the single facility location(the weighted geometric median) which minimize the sum of weighted Euclidean distances in some text books and papers. Firstly, we show that the demand point whose volume of demand exceeds the half of total demand is the weighted geometric median differently from the centroid, and we examine the weighed geometric median when every demand point is located on a line. Meanwhile, we could simply see that the geometric median and the centroid are coincident in the special case when every demand point is located at a vertex of a regular polygon, and every volume of demand is equal. Furthermore, the geometric medians of convex tetragons could be simply attained unlike triangles.

• Journal of Distribution Science
• /
• v.6 no.1
• /
• pp.47-62
• /
• 2008

Joining the WTO in 2001, China became a number of the global economic system. China succeeded in vying to host Beijing 2008 Olympic Games and World Expo 2010 Shanghai. It is China's honor and opportunity to have high economic growth in the coming future. In 2007, the total cost of public logistics decreased by 18.2% than 2006 to 4540.6 billion RMB, accounting for 18.4% of the GDP. So, China logistics is a huge industry and a growing market full of charm. The statistic ratios of China's logistics and growth trends show us it is an important issue to build and run an effective logistics system. However, research on China's logistics systems and supply chain is lacked. This study is focus on the logistic location strategy in China including the study of factories and warehouses geographic strategy concerned with SCM. The core of this study is to propose a New Multi-Facilities Location Decision Model. This study banded the revised gravity center, the standard single facility location decision model(Gravity Center Model) and the transportation model into a new Multi-Facilities Location Decision Model. In addition, this study suggested the gravity center of population, the gravity center of each industry, the location decision graded-list of each industry of china using the gravity center model and the revised gravity center model. The new Multi-Facilities Location Decision Model proposed in this study can be used to solve the location decision problem of more than two facilities. And it can be used in the fields such as the location decision of production facility and service facility, the location of distribution and logistics, the location of broadcast and satellite communications, the location of wireless communication tower and so on.

• Proceeding of Spring/Autumn Annual Conference of KHA
• /
• 2006.11a
• /
• pp.452-455
• /
• 2006

The purpose of this study is to investigate tendencies on land use by grasping the characteristics of changes of use at the borders of single-detached housing area for planning single-detached housing area in the future. It is divided the borders of detached housing areas into three types, educational facility, parks and green spaces, and apartment complex, and then analyzed the characteristics of each location after a field study. It is summarized as follows. First, warehouses and vacant sites were distributed in adjacent borders near parks and green areas. Second, there were stationery and flour-based meal stores in adjacent borders near educational facilities, suitable for students' interest and motion patterns. Third, there were realty dealers, food stores, and laundries which provide the dwellers with service in adjacent borders near multi-family housing.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.4
• /
• pp.15-19
• /
• 1998

This paper concerns a bulk or semibulk cargo ship scheduling problem with a single loading port. This type of ship scheduling problem is frequently needed in real world for carrying minerals or agricultural produce from a major single production zone to many destinations scattered over a large area of the world. The first optimization model for this problem was introduced by Ronen (1986) as a nonlinear mixed integer program. The model developed in this paper is an improvement of his model in the sense that nonlinearities and numerous unnecessary integer variables have been eliminated. By this improvement we could expect real world instances of moderate sizes to be solved optimal solutions by commercial integer programming software. Similarity between the ship scheduling model and the capacitated facility location model is also discussed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.67-84
• /
• 2000

In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.