• 한국국방경영분석학회지
• /
• 제23권1호
• /
• pp.14-24
• /
• 1997

This study is to develop an optimal surveillance units assignment model in order to obtain the maximized surveillance efficiency with the limited surveillance units. There are many mathematical models which deal with problems to assign weapons such as aircrafts, missiles and guns to targets. These models minimize the lost required to attack, the threat forecast from the enemy, or both of them. However, a problem of the efficient assignment of surveillance units is not studied yet, nevertbless it is important in the battlefield surveillance system. This paper is concerned with the development of the optimal surveillance units assignment model using integer programming. An optimal integer solution of the model can be obtained by using linear programming and branch and bound method.

• 산업공학
• /
• 제13권4호
• /
• pp.694-702
• /
• 2000

For the graceful transition from the analog to digital TV systems, a systematic frequency assignment scheme must be incorporated into the transition planning procedure. In this study, we have studied the frequency assignment methodology for the efficient management of the limited spectrum resources. By applying the graph-theoretic approach, this study developed a new solution method for additional frequency assignment problem whose objective is to assign available frequencies for newly generated requirements (digital TV stations) with minimum reassignment of the preassigned frequencies to LPTV stations while meeting the interference-related constraints. The proposed algorithm can be effectively applied not only to the current digital TV introduction phase but also to the development phase with some further development. This study can be utilized as the basis for the future study on frequency assignments that aims at graceful transition from analog TV to digital TV.

• 대한산업공학회지
• /
• 제26권4호
• /
• pp.296-305
• /
• 2000

Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

• 한국콘텐츠학회논문지
• /
• 제6권4호
• /
• pp.46-54
• /
• 2006

다수 대의 표면실장기를 포함한 PCB조립라인의 생산성 향상을 위한 방법을 제시한다. PCB조립시간의 단축을 위하여 각 실장기 별로 부품공급 피더의 배치 및 실장순서가 최적화 되어야 하며, 표면실장기들의 라인 밸런스를 위하여 부품 할당이 최적화 되어야 한다. 전체의 최적화 문제를 정수계획문제로 수식화하며, 전향경로문제와 후향경로 문제로 분할하여 구성한다. 클러스터링 알고리즘과 branch-and-bound 알고리즘을 사용하여 전향경로문제의 해를 구하며, 할당 알고리즘과 연결 알고리즘을 사용하여 후향경로 문제의 해를 구한다. 시뮬레이션 결과를 통하여 제안된 방법의 성능을 평가한다.

• 산업경영시스템학회지
• /
• 제45권4호
• /
• pp.42-52
• /
• 2022

North Korea continues to upgrade and display its long-range rocket launchers to emphasize its military strength. Recently Republic of Korea kicked off the development of anti-artillery interception system similar to Israel's "Iron Dome", designed to protect against North Korea's arsenal of long-range rockets. The system may not work smoothly without the function assigning interceptors to incoming various-caliber artillery rockets. We view the assignment task as a dynamic weapon target assignment (DWTA) problem. DWTA is a multistage decision process in which decision in a stage affects decision processes and its results in the subsequent stages. We represent the DWTA problem as a Markov decision process (MDP). Distance from Seoul to North Korea's multiple rocket launchers positioned near the border, limits the processing time of the model solver within only a few second. It is impossible to compute the exact optimal solution within the allowed time interval due to the curse of dimensionality inherently in MDP model of practical DWTA problem. We apply two reinforcement-based algorithms to get the approximate solution of the MDP model within the time limit. To check the quality of the approximate solution, we adopt Shoot-Shoot-Look(SSL) policy as a baseline. Simulation results showed that both algorithms provide better solution than the solution from the baseline strategy.

• 한국경영과학회지
• /
• 제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.

• 한국경영과학회지
• /
• 제22권4호
• /
• pp.17-35
• /
• 1997

This paper considers the efficient design of routing path and wavelength assignment in the single-hop WDM optical transport networks. The connection demands between node-pairs are given and a connection between a pair of nodes must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network and the number of available wavelengths of a physical link are also given. This paper proposes the method to route a path and assign a wavelength to the path, which guarantees fairness to every node pair. In order to guarantee fairness and maximize connections, an optimization model is established, which successively maximizes minimum connection ratio to the demand of each node pair. A heuristic algorithm with polynomial iterations is developed for the problem since the problem is NP-hard. The heuristic algorithm is implemented and applied to the networks with real problem sizes. The results of the application are compared with GAMS/OSL.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.525-528
• /
• 2006

This paper considers the vehicle dispatching problem in the automated material handling system (AMHS) of a large scale semiconductor fabrication line, which consists of 18 bays, 468 equipments and uses more than 130 overhead hoist transporters (OHT). We propose an assignment problem based vehicle dispatching approach to take advantage of simultaneous vehicle reassignment based on up-to-date system status. The proposed approach compares fsvorably with the shortest travel distance first rule and with the reassignment based rule which was recently proposed by the authors, in the number of vehicles required and the average lead time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3413-3430
• /
• 2017

With the fast increasing popularity of mobile services, ubiquitous mobile devices with enhanced sensing capabilities collect and share local information towards a common goal. The recent Mobile Crowd Sensing (MCS) paradigm enables a broad range of mobile applications and undoubtedly revolutionizes many sectors of our life. A critical challenge for the MCS paradigm is to induce mobile devices to be workers providing sensing services. In this study, we examine the problem of sensing task assignment to maximize the overall performance in MCS system while ensuring reciprocal advantages among mobile devices. Based on the overlapping coalition game model, we propose a novel workload determination scheme for each individual device. The proposed scheme can effectively decompose the complex optimization problem and obtains an effective solution using the interactive learning process. Finally, we have conducted extensive simulations, and the results demonstrate that the proposed scheme achieves a fair tradeoff solution between the MCS performance and the profit of individual devices.

• 산업공학
• /
• 제13권4호
• /
• pp.556-563
• /
• 2000

In this paper, we consider wavelength assignment problem (WAP) in Wavelength division multiplexed (WDM) unidirectional optical telecommunication ring networks. We show that, even though WAP on unidirectional ring belongs to NP-hard, WAP can be exactly solvable in real-sized WDM rings for near future demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We use a column generation technique in a branch-and-price framework for the suggested formulation. We also propose some generic heuristics and do the performance comparison with the suggested optimization algorithm.