• 제목/요약/키워드: p-Median Problem

검색결과 46건 처리시간 0.028초

An assignment method for part-machine cell formation problem in the presence of multiple process routes

  • Won, You-Kyung;Kim, Sehun
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.236-243
    • /
    • 1994
  • In this paper we consider the part-machine cell formation decision of the generalized Group Technology(GT) problem in which multiple process routes can be generated for each part. The existing p-median model and similarity coefficient algorithm can solve only small-sized or well-structured cases. We suggest an assignment method for the cell formation problem. This method uses an assignment model which is a simple linear programming. Numerical examples show that our assignment method provides good separable cells formation even for large-sized and ill-structured problems.

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

  • 최기주;김숙희;신강원
    • 대한교통학회지
    • /
    • 제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의 통합적용을 통해 수행될 수 있을 것이다.

  • PDF

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

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

Mathematical Programming Approaches to GT Cell Formation: A Comparative Study

  • 원유경
    • 한국경영과학회지
    • /
    • 제16권2호
    • /
    • pp.137-137
    • /
    • 1991
  • This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized p-median model. is proposed. Unlike existing p-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

Mathematical Programming Approaches to GT Cell Formation: A Comparative Study

  • 원유경
    • 경영과학
    • /
    • 제16권2호
    • /
    • pp.137-147
    • /
    • 1999
  • This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized {{{{ { p}_{ } }}-median model. is proposed. Unlike existing {{{{ { p}_{ } }}-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

  • PDF

GT 셀 형성을 위한 효율적 Ρ-median 접근법 (Efficient Ρ-median approach to GT cell formation)

  • Won, Youkyung
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.40-43
    • /
    • 2000
  • This paper is concerned with development of an efficient Ρ-median approach applicable to large cell formation(CF) problems. A two-phase methodology that seeks to minimize the number of exceptional elements is proposed. In phase I, two efficient Ρ-median formulations which contain fewer binary variables than existing Ρ-median formulations are constructed. These make it possible to implement large CF problem within reasonable computer runtime with commercially available linear integer programming codes. Given the initial cell configuration found with the new p-median formulations, in phase II bottleneck machines and parts are reassigned to reduce the number of exceptional elements. This procedure has the flexibility to provide the cell designer with alternative solutions. Test results on large CF problems show a substantial efficiency of the new Ρ-median formulations.

  • PDF

트리 네트워크 상에서의 p-미디안 문제에 대한 효율적인 알고리즘 개발에 관한 연구 (A Study on Developing an Efficient Algorithm for the p-median Problem on a Tree Network)

  • 조건
    • 한국경영과학회지
    • /
    • 제29권1호
    • /
    • pp.57-70
    • /
    • 2004
  • Given a tree network on which each node has its own demand and also stands for a candidate location of a potential facility. such as plant or warehouse, the f-median problem on the network (PMPOT) is to select less than or equal to P number of facility locations so that the whole demand on a node is satisfied from only one facility and the total demand occurred on the network can be satisfied from those facilities with the minimum total cost, where the total cost Is the sum of transportation costs and the fixed costs of establishing facilities. Tamir(1996) developed an O(p n$^2$) algorithm for PMPOT which is known to be the best algorithm In terms of the time complexity, where n is the number of nodes in the network, but he didn't make any comments or explanation about implementation details for finding the optimal solution. In contrast to Tamir's work, Kariv and Hakimi(1979) developed O(p$^2$n$^2$) algorithm for PMPOT and presented O(n$^2$) algorithm for finding the optimal solution in detail. In this paper, we not only develop another O(p n$^2$) dynamic programming algorithm for PMPOT that is competitive to Tamir's algorithm in terms of the time complexity, but also present O(n) algorithm that is more efficient than kariv and Hakimi's algorithm in finding the optimal solution. finally, we implement our algorithm on a set of randomly generated problems and report the computational results.

Derivation of response spectrum compatible non-stationary stochastic processes relying on Monte Carlo-based peak factor estimation

  • Giaralis, Agathoklis;Spanos, Pol D.
    • Earthquakes and Structures
    • /
    • 제3권5호
    • /
    • pp.719-747
    • /
    • 2012
  • In this paper a novel approach is proposed to address the problem of deriving non-stationary stochastic processes which are compatible in the mean sense with a given (target) response (uniform hazard) spectrum (UHS) as commonly desired in the aseismic structural design regulated by contemporary codes of practice. The appealing feature of the approach is that it is non-iterative and "one-step". This is accomplished by solving a standard over-determined minimization problem in conjunction with appropriate median peak factors. These factors are determined by a plethora of reported new Monte Carlo studies which on their own possess considerable stochastic dynamics merit. In the proposed approach, generation and treatment of samples of the processes individually on a deterministic basis is not required as is the case with the various "two-step" approaches found in the literature addressing the herein considered task. The applicability and usefulness of the approach is demonstrated by furnishing extensive numerical data associated with the elastic design UHS of the current European (EC8) and the Chinese (GB 50011) aseismic code provisions. Purposely, simple and thus attractive from a practical viewpoint, uniformly modulated processes assuming either the Kanai-Tajimi (K-T) or the Clough-Penzien (C-P) spectral form are employed. The Monte Carlo studies yield damping and duration dependent median peak factor spectra, given in a polynomial form, associated with the first passage problem for UHS compatible K-T and C-P uniformly modulated stochastic processes. Hopefully, the herein derived stochastic processes and median peak factor spectra can be used to facilitate the aseismic design of structures regulated by contemporary code provisions in a Monte Carlo simulation-based or stochastic dynamics-based context of analysis.