• 한국국방경영분석학회지
• /
• 제8권1호
• /
• pp.53-70
• /
• 1982

This thesis develops a more realistic and applicable new set covering model that is adjusted and supplied by the existing set covering models, and induces an algorithm for solving the new set covering model, and applies the new model and the algorithm to an actual set covering problems. The new set covering model introduces a probabilistic covering aistance ($0{\eqslantless}p{\eqslantless}1$)or time($0{\eqslantless}p{\eqslantless}1$) instead of a deterministic covering distance(0 or 1) or time (0 or 1) of the existing set covering model. The existing set covering model has not considered the merit of the overcover of customers. But this new set covering model leads a concept of this overcover to a concept of the parallel system reliability. The algorithm has been programmed on the UNIVAC 9030 for solving large-scale covering problems. An application of the new set covering model is presented in order to determine the locations of the air surveillance radars as a set covering problem for a case-study.

• International Journal of Reliability and Applications
• /
• 제5권4호
• /
• pp.147-154
• /
• 2004

This work developed and algorithm for a set covering model when the reliability of covers is a concern. This model extended the usage of the set covering model.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.13-17
• /
• 2012

Set covering has widely been accepted as a staple tool for feature selection in data mining. We present a generalized version of this classical combinatorial optimization model to make it better suited for the purpose and propose a surrogate relaxation-based procedure for its meta-heuristic solution. Mathematically and also numerically with experiments on 25 set covering instances, we demonstrate the utility of the proposed model and the proposed solution method.

• 한국컴퓨터정보학회논문지
• /
• 제20권9호
• /
• pp.21-29
• /
• 2015

The set partitioning problem is a well-known NP-hard combinatorial optimization problem, and it is formulated as an integer programming model. This paper proposes an Integer Programming-based Local Search for solving the set partitioning problem. The key point is to solve the set partitioning problem as the set covering problem. First, an initial solution is generated by a simple heuristic for the set covering problem, and then the solution is set as the current solution. Next, the following process is repeated. The original set covering problem is reduced based on the current solution, and the reduced problem is solved by Integer Programming which includes a specific element in the objective function to derive the solution for the set partitioning problem. Experimental results on a set of OR-Library instances show that the proposed algorithm outperforms pure integer programming as well as the existing heuristic algorithms both in solution quality and time.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.48-69
• /
• 2004

An optimal allocation model for SAM-X by using a set covering model is suggested. This allocation model considers to guarantee the maximum security of vital areas from the attack of enemy aircraft(s) and missiles. In order to formulate this model, we applied the concept of parallel structure reliability to set covering model. This model gives both direction of the primary target line and location of the facility. When applied this model to the real situation, the solution of this model can be used to the references of decision making for the optimal military facility allocation.

• 한국경영과학회지
• /
• 제27권4호
• /
• pp.87-109
• /
• 2002

A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

• 한국ITS학회 논문지
• /
• 제16권4호
• /
• pp.13-24
• /
• 2017

본 연구에서는 무인택배함의 최적입지를 선정하기 위한 입지조건 정의, 설치개수 결정, 최적입지 선정의 과정을 순차적으로 결합한 방법론을 개발한다. 우선 입지조건으로는 블록화, 접근성, 지역 중심공공시설이 제시되며, 선정된 입지에 대해 set-covering모형과 p-median 모형을 적용하여 설치개수와 최적입지를 각각 결정한다. 이러한 과정을 실제 사례에 적용해봄으로써 모형의 타당성과 실효성을 검증해 본다. 일반주택과 다세대주택으로만 구성된 안산의 한 지역을 대상으로 분석한 결과, 필요한 무인택배함은 2개로 결정되었으며, 5개 후보지 중 가장 적절한 2개 장소가 최적입지로 제시되었다. 이러한 방법론은 무인택배함 설치시 최적의 결정을 내리기 위한 가이드라인을 제공하며, 택배 관련 강력범죄 예방 및 택배이용 활성화를 통한 경제적 파급효과를 기대해 볼 수 있다.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.43-56
• /
• 2009

In korean peninsular, aircraft defense with SAM (Surface-to-Air Missile) is very important because of short range of combat space in depth. 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 Set covering model which can handle both factors simultaneously and Multi-heuristic algorithm for solving allocation problem of the batteries and missile assignment problem in each battery. Genetic algorithm is used to decide optimal location of the batteries. To determine the number of SAM, a heuristic algorithm is applied for solving missile assignment problem. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of air defense operations.

• 대한산업공학회지
• /
• 제41권4호
• /
• pp.396-407
• /
• 2015

The literature about intelligence assets allocation focused on mainly single or partial assets such as TOD and GSR. Thus, it is limited in application to the actual environment of operating various assets. In addition, field units have generally vulnerabilities because of depending on qualitative analysis. Therefore, we need a methodology to ensure the validity and reliability of intelligence asset allocation. In this study, detection probability was generated using digital geospatial data in MGIS (Military Geographic Information System) and simulation logic of BCTP (Battle Commander Training Programs) in the R.O.K army. Then, the optimal allocation mathematical model applied concept of simultaneous integrated management, which was developed based on the partial set covering model. Also, the proposed GA (Genetic Algorithm) provided superior results compared to the mathematical model. Consequently, this study will support effectively decision making by the commander by offering the best alternatives for optimal allocation within a reasonable time.

• 한국시뮬레이션학회논문지
• /
• 제15권4호
• /
• pp.69-77
• /
• 2006

위치 선정이나 설비배치문제를 기존의 정성적 접근방법에서 벗어나 수학적 방법을 통해 해결하려는 시도가 여러 분야에서 이루어지고 있다. 지역담당모형은 이러한 연구 분야중 하나로 주어진 문제를 수학적으로 현실과 유사하게 구현시킬 수 있고 모형에 대한 해법절차도 다양하기 때문에 여러 형태의 배치문제들에도 폭넓게 적용되어 왔으며 최근 들어서는 군사설비분야에서도 그 활용도가 높아지고 있다. 본 연구는 미사일 방어를 위하여 한국해군 KDX 함정의 최적배치에 대한 시뮬레이션 모델을 구축하였다. 시뮬레이션 모델은 부분지역담당모형을 바탕으로 공격자와 방어자의 측면을 단계적으로 평가하는 방법으로 구현되어 있으며, 구축된 모형에 대하여 가능한 시나리오를 설정하고 실험을 통하여 결과를 분석하였다. 구현된 모형실험은 공격자의 공격계획과 공격계획에 따른 최적의 KDX 배치선정과 방어미사일 할당에 대한 의사결정방안을 제시하고 있다. 본 연구의 최적배치모형은 한국적 미사일방어 체계구축을 위하여 도입될 최신무기체계의 위치선정에 대한 최적의 대안을 제시하고 효율적인 부대배치를 위한 참고자료로 활용할 수 있을 것이다.