• 한국경영과학회지
• /
• 제15권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.

• 산업경영시스템학회지
• /
• 제5권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.

• 한국콘텐츠학회논문지
• /
• 제10권9호
• /
• pp.107-116
• /
• 2010

시설물 입지 선정 문제(FLP)는 전통적인 최적화 문제중에 하나이다. FLP에 공급제약과 하나의 고객은 하나의 시설물에서만 제품을 공급받을 수 있다는 제약을 추가하면 단일 시설물 공급제약을 가지는 시설물 위치 설정 문제(SSFLP)가 된다. SSFLP는 NP-hard 문제로 알려져 있으며 진화 알고리즘과 같은 휴리스틱 알고리즘을 사용하여 해결하는 것이 일반적이다. 본 논문에서는 SSFLP를 위한 효율적인 진화 알고리즘을 제안한다. 제안하는 알고리즘은 적응형 링크 조절 진화 알고리즘과 3가지 휴리스틱 해 개선 방법을 조합하여 고안되었다. 제안하는 알고리즘을 벤치마크 문제에 적용하여 다른 알고리즘과 성능을 비교분석해 본 결과, 제안하는 알고리즘은 중간 크기의 문제에서 대부분 최적해를 찾았으며 큰 문제에서도 안정된 결과를 보여주었다.

• 산업경영시스템학회지
• /
• 제7권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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• 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.

• 한국콘텐츠학회논문지
• /
• 제19권2호
• /
• pp.186-193
• /
• 2019

본 연구에서는 일반적으로 생산운영관리 교재나 일부 연구들에서, 각 수요지에서 가중 유클리디안 거리의 합이 가장 작은 새로운 단일 설비의 위치(가중기하중위점)를 찾고자 할 때, 무게중심점을 대안으로 사용하는 것에 의문을 가지고 두 지점의 차이와 유사점을 살펴본다. 먼저, 수요지 가운데 한 곳의 수요량이 전체의 절반을 초과한다면, 그곳이 무게중심점과는 완전히 별개로 가중기하중위점이 됨을 보였고, 모든 수요지가 일직선상에 있는 특별한 경우의 가중기하중위점의 위치를 살펴보았다. 한편, 정n각형에서 각각의 꼭짓점에 수요량이 동일한 수요지들이 위치한 특별한 경우에는 기하중위점이 무게중심점과 일치함을 쉽게 알 수 있다. 또한, 삼각형과는 달리 볼록사각형의 경우에는 기하중위점의 위치를 간단히 구할 수 있다.

• 유통과학연구
• /
• 제6권1호
• /
• pp.47-62
• /
• 2008

2007년 중국 물류비용이 GDP에서 18.4%의 비중을 차지하고 2006년보다 18.2% 증가했다. 중국 물류비중과 증가추세를 감안할 때 효과적인 물류시스템구축과 운영이 중요한 과제로 인식되고 있으나 중국의 물적 유통시스템, 공급사슬관리에 관한 연구 성과는 미흡하다. 본 연구는 공급사슬관리의 생산요소 및 배송요소와 관련된 공장이나 창고 등 시설의 입지 문제를 다루었다. 본 연구는 기존의 단일 시설입지결정모형인 무게중심법과 수송계획법에 본 연구에서 제안한 수정무게중심법을 결합하여 새로운 복수시설의 입지결정모형을 제시하였다. 본 연구에서 제안한 새로운 복수시설 선정모형은 두 개 이상의 시설물 입지선정 문제에 활용할 수 있고 생산 및 서비스 시설, 유통 및 물류 시설 입지, 방송 및 통신위성의 위치, 무선통신탑의 입지 등에 활용할 수 있다.

• 한국주거학회:학술대회논문집
• /
• 한국주거학회 2006년도 추계학술발표대회 논문집
• /
• 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.

• 한국항해학회지
• /
• 제22권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.

• 한국경영과학회지
• /
• 제25권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.