• Title/Summary/Keyword: P-Median heuristic method

Search Result 3, Processing Time 0.018 seconds

Oil Tank Location Problem Solving with Mixed Integer Programming & GIS (혼합정수계획법 및 GIS를 활용한 유류저장탱크의 입지선정)

  • 최기주;김숙희;신강원
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.5
    • /
    • pp.99-108
    • /
    • 2001
  • A framework of using and integrating GIS and OR tools for determining the best site selection has been provided. In this research, we demonstrated that both the P-Median heuristic method and MIP method can be successfully applied to the optimum site selection problem of oil tank location selection. Furthermore, the results identified by both approaches are identical. To accomplish this, both GIS road and maritime networks have been constructed and combined to calculated the minimum distance matrix, which is required by both approaches. After the application to the Korean peninsula, the facility locations chosen are Kunsan, Yosu, Busan, and Okgye for each district. As has been shown, the power of GIS and both algorithm have been demonstrated throughout the research and further similar research can also be conducted using the power of GIS and Operations Research tools.

  • PDF

Location-Routing Problem for Reconnaissance Surveillance Missions of the Maritime Manned-Unmanned Surface Vehicles (해양 유·무인 수상함정의 감시정찰 임무를 위한 위치-경로 문제)

  • Jinho Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.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.

A Heuristic Approach to Machine-Part Grouping Cellular Manufacturing (셀 생산방식에서 기계-부품 그룹을 형성하는 발견적 해법)

  • Kim Jin-Seock;Lee Jong-Sub;Kang Maing-Kyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.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.