• 제목/요약/키워드: set covering

검색결과 248건 처리시간 0.036초

Simulated Annealing 알고리듬을 이용한 SAM-X 추가전력의 최적배치 (Efficient Simulated Annealing Algorithm for Optimal Allocation of Additive SAM-X Weapon System)

  • 이상헌;백장욱
    • 산업공학
    • /
    • 제18권4호
    • /
    • pp.370-381
    • /
    • 2005
  • This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

패트리어트 (patriot) 미사일의 최적 배치 (Optimal deployment strategy of patriot missile)

  • 김영휘;김성인;오원민
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.29-37
    • /
    • 1994
  • It is reported that north Korea has already developed 1,500 to 2,000-km-range Scud missile. As a defensive strategy against Scud attack on military and civilian facilities the military authorities are considering deployment of Patriot missile. This paper deals with its optimal deployment strategy. In this problem a Patriot missile which has multiple-facility responsibility may be able to protect each of its assigned facilities only with a certain probability, not absolute protection, and it may not be adequate to have only a single missile protect a facility, either because of its operational reliability or because of its limited availability at any given point in time. We formulate this problem into the probabilistic partial set covering model developed by Sherali and Kim. The applicability, verification and validation of the model are tested via an abbreviated case study.

Tandem형 AGV 를 통합한 셀형 제조시스템의 설계 (Design of Cellular Manufacturing Systems Integrating Automated Guided Vehicles under a Tandem Configuration)

  • 고창성
    • 한국경영과학회지
    • /
    • 제23권1호
    • /
    • pp.17-28
    • /
    • 1998
  • This study suggests a procedure for designing cellular manufacturing systems (CMS) which are combined with automated guided vehicles (AGVs) using a tandem configuration. So far most of the previous studies have dealt with conventional design problems not considering the layout and the characteristics of transporters used in CMS. A mathematical model is developed using the service time to perform material transfers as a suitable meassure. The service capacity of AGVs and space limitations are also reflected in this model. As the model can be shown strongly NP-hard, a heuristic algorithm is presented, in which each cell is temporarily formed using both the set covering model and similarity coefficients, and then locations of the cells are determined by means of tabu search and finally machine perturbations are carried out. An example problem is solved to demonstrate the algorithm developed.

  • PDF

최적화에 근거한 LAD의 패턴생성 기법 (Optimization-Based Pattern Generation for LAD)

  • 장인용;류홍서
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.409-413
    • /
    • 2005
  • The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

  • PDF

IP를 이용한 패트리어트 미사일 최적배치모형

  • 이재영;정치영
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.38-50
    • /
    • 2005
  • The current Air defense missile, Nike, will be replaced by the Patriot missile in the near future. In this paper, we developed an optimal allocation model for the Patriot missile. In order to formulate the model, we applied a set covering and If model. This model considers not only weapon's characteristics and performances but also the threat of enemy aircrafts and SCUD missiles. When we apply this model, we can find the optimal location of Patriot batteries which maximizes the kill probability of enemy aircrafts and SCUD missiles attacking vital area of our forces. This model can directly be used to the decision making for the optimal military facility allocation.

  • PDF

STUDY ON TOPOLOGICAL SPACES WITH THE SEMI-T½ SEPARATION AXIOM

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제35권4호
    • /
    • pp.707-716
    • /
    • 2013
  • The present paper consists of two parts. Since the recent paper [4] proved that an Alexandroff $T_0$-space is a semi-$T_{\frac{1}{2}}$-space, the first part studies semi-open and semi-closed structures of the Khalimsky nD space. The second one focuses on the study of a relation between the LS-property of ($SC^{n_1,l_1}_{k_1}{\times}SC^{n_2,l_2}_{k_2}$, k) relative to the simple closed $k_i$-curves $SC^{n_i,l_i}_{k_i}$, $i{\in}\{1,2\}$ and its normal k-adjacency. In addition, the present paper points out that the main theorems of Boxer and Karaca's paper [3] such as Theorems 4.4 and 4.7 of [3] cannot be new assertions. Indeed, instead they should be attributed to Theorems 4.3 and 4.5, and Example 4.6 of [10].

인공근육을 이용한 얼굴로봇 (A Face Robot Actuated with Artiflcial Muscle)

  • 곽종원;지호준;정광목;남재도;전재욱;최혁렬
    • 제어로봇시스템학회논문지
    • /
    • 제10권11호
    • /
    • pp.991-999
    • /
    • 2004
  • Face robots capable of expressing their emotional status, can be adopted as an efficient tool for friendly communication between the human and the machine. In this paper, we present a face robot actuated with artificial muscle based on dielectric elastomer. By exploiting the properties of polymers, it is possible to actuate the covering skin, eyes as well as provide human-like expressivity without employing complicated mechanisms. The robot is driven by seven types of actuator modules such as eye, eyebrow, eyelid, brow, cheek, jaw and neck module corresponding to movements of facial muscles. Although they are only part of the whole set of facial motions, our approach is sufficient to generate six fundamental facial expressions such as surprise, fear, anger, disgust, sadness, and happiness. Each module communicates with the others via CAN communication protocol fur the desired emotional expressions, the facial motions are generated by combining the motions of each actuator module. A prototype of the robot has been developed and several experiments have been conducted to validate its feasibility.

The Novel Concepts for Reliability Technology

  • Ryu, DongSu
    • Corrosion Science and Technology
    • /
    • 제4권5호
    • /
    • pp.201-206
    • /
    • 2005
  • Starting with the meaning of the word quality, diverse concepts connoted by the term are examined. Instead of a bathtub curve, the desirable shape of a failure rate covering the entire life of a good product, which might be called hockey-stick line, is introduced. From the hockey-stick line and the definition of reliability, two measurements are extracted. The terms r-reliability (failure rate) and durability (product life) are explained. The conceptual analysis of failure mechanics explains that reliability technology pertains to design area. The desirable shape of hazard rate curve of electronic items, hockey-stick line, clarifies that Mean-Time-to-failure (MTTF) as the inverse of failure rate can be regarded a nominal life. And Bx life, different from MTTF, is explained. Reliability relationships between components and set products are explained. Reshaped definitions of r-reliability and durability are recommended. The procedure to improve reliability and the reasons for failing to identify failure mode are clarified in order to search right solutions. And generalized Life-Stress failure model is recommended for the calculation of acceleration factor.

복합-휴리스틱 알고리즘을 이용한 지대공 유도무기(SAM) 최적배치 방안 : 탄도미사일 방어를 중심으로 (The Optimal Allocation Model for SAM Using Multi-Heuristic Algorithm : Focused on Theater Ballistic Missile Defense)

  • 이재영;곽기훈
    • 산업공학
    • /
    • 제21권3호
    • /
    • pp.262-273
    • /
    • 2008
  • In Korean peninsular, Air Defense with SAM(Surface-to-Air Missile) is very important, because of threatening by North Korea's theater ballistic missiles installed with nuclear or biochemistry. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Multi-heuristic algorithm which can handle both factors simultaneously for solving allocation problem of the batteries and missile assignment problem in each battery. To solve allocation problem, genetic algorithm is used to decide location of the batteries. To solve missile assignment problem, a heuristic algorithm is applied to determine the number of SAM for each target. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of missile defense operations.

시뮬레이션과 최적화 모형을 혼합 적용한 구급차 위치선정 모형의 해법연구 (A Study of Ambulance Location Problem Applying the Iterative Procedure of Simulation and Optimization)

  • 임영선;김선훈;이영훈
    • 한국경영과학회지
    • /
    • 제37권4호
    • /
    • pp.197-209
    • /
    • 2012
  • This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.