• 대한교통학회지
• /
• 제19권5호
• /
• pp.99-108
• /
• 2001

본 논문은 유류저장탱크의 최적입지를 선정하기 위한 GIS와 OR 통합적용기법을 제시하며, P-Median heuristic method와 MIP method가 모두 유류저장탱크의 최적입지 선정 문제에 적용될 수 있음을 실증하였다. 또한, 두 접근 방식에 의해 확인된 결과들은 동일하였다. P-Median heuristic method와 MIP method 를 풀이하는데 필요한 최단거리 매트릭스를 계산해내 기 위해 GIS기반 도로망과 해운네트워크를 구축·결합하였으며, 두 접근방법을 통해 우리나라의 최적 유류저장탱크의 입지를 선정한 결과 권역별로 군산항, 여수항, 부산항, 옥계항이 선정되었다. 위와 같이, 본 연구를 통해 CIS와 P-Median heuristic method, MIP method의 적용은 실증되었으며, 유사한 연구 또한 GIS와 OR의 통합적용을 통해 수행될 수 있을 것이다.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.238-245
• /
• 2023

As technologies have been more quickly developed in this 4th Industry Revolution era, their application to defense industry has been also growing. With these much advanced technologies, we attempt to use Manned-Unmanned Teaming systems in various military operations. In this study, we consider the Location-Routing Problem for reconnaissance surveillance missions of the maritime manned-unmanned surface vehicles. As a solution technique, the two-phase method is presented. In the first location phase, the p-median problem is solved to determine which nodes are used as the seeds for the manned vehicles using Lagrangian relaxation with the subgradient method. In the second routing phase, using the results obtained from the location phase, the Vehicle Routing Problems are solved to determine the search routes of the unmanned vehicles by applying the Location Based Heuristic. For three network data sets, computational experiments are conducted to show the performance of the proposed two-phase method.

• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.121-128
• /
• 2005

This paper proposes the heuristic approach for the generalized GT(Group Technology) problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This approach is classified into two stages. In the first stage, we use the similarity coefficient method which is proposed and calculate the similarity values about each pair of all machines and align these values in descending order. If two machines which is selected is possible to link the each other on the edge of machine cell and they don't have zero similarity value, then we assign the machines to the machine cell. In the second stage, it is the course to form part families using proposed grouping efficacy. Finally, machine-part incidence matrix is realigned to block diagonal structure. The results of using the proposed approach are compared to the Modified p-median model.