• 경영과학
• /
• 제20권1호
• /
• pp.65-76
• /
• 2003

The increased environmental concerns and the emphasis on recycling are gradually shifting the orientation of municipal solid waste (MSW) management. This paper is designed to evaluate regionalization programs for MSW management system. We developed a mixed intiger network programming (MIP) model to identify environment-friendly, cost-effective expansion plans for regionalization scenarios considered. The MIP model is a dynamic capacity expansion model based on the network flow model that depicts the MSW management cycle. In particular, our model is designed to determine the optimal form of regionalization using binary variables. We apply this model to assess the regionalization program of Seoul Metropolitan City, which includes three scenarios such as 1) districting, 2) regionalization with neighboring self-governing districts, and 3) g1obalization with all districts. We demonstrate how our model can be used to plan the MSW system. The results indicate that optimal regionalization with nearby self-governing districts can eliminate unnecessary landfills and expansions if jurisdictional obstacles are removed.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.1-15
• /
• 1990

A mathematical definition of the cluster is suggested. A nonlinear 0-1 integer programming formulation for the multi-dimensional entity clustering problem is developed. A heuristic method named MDEC (Multi-Dimensional Entity Clustering) using centroids and the binary partition is developed and the numerical examples are shown. This method has an advantage of providing bottle-neck entity informations.

• 산업경영시스템학회지
• /
• 제13권21호
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• 산업경영시스템학회지
• /
• 제43권4호
• /
• pp.150-160
• /
• 2020

In this paper, we introduce a pilot's scheduling model which is able to maintain and balance their capabilities for each relevant skill level in military helicopter squadron. Flight scheduler has to consider many factors related pilot's flight information and spends a lot of times and efforts for flight planning without scientific process depending on his/her own capability and experience. This model reflected overall characteristics that include pilot's progression by basis monthly and cumulative flight hours, operational recent flight data and quickly find out a pinpoint areas of concern with respect to their mission subjects etc. There also include essential several constraints, such as personnel qualifications, and Army helicopter training policy's constraints such as regulations and guidelines. We presented binary Integer Programming (IP) mathematical formulation for optimization and demonstrated its effectiveness by comparisons of real schedule versus model's solution to several cases experimental scenarios and greedy random simulation model. The model made the schedule in less than 30 minutes, including the data preprocessing process, and the results of the allocation were more equal than the actual one. This makes it possible to reduce the workload of the scheduler and effectively manages the pilot's skills. We expect to set up and improve better flight planning and combat readiness in Korea Army aviation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.170-174
• /
• 2003

In this research, we consider an integrated manufacturing/distribution planning problem in supply chain (SC) which has non-integer time lags. We focus on a capacitated manufacturing planning and capacity allocation problem for the system. We develop a mixed binary integer linear programming (MBLP) model and propose an efficient heuristic procedure using an adaptive genetic algorithm, which is composed of a regeneration procedure for evaluating infeasible chromosomes and the reduced costs from the LP-relaxation of the original model. The proposed an adaptive genetic algorithm was tested in terms of the solution accuracy and algorithm speed during numerical experiments. We found that our algorithm can generate the optimal solution within a reasonable computational time.

• 산업경영시스템학회지
• /
• 제39권1호
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권4호
• /
• pp.293-298
• /
• 2016

Document summarization is an important task in various areas where the goal is to select a few the most descriptive sentences from a given document as a succinct summary. Even without training data of human labeled summaries, there has been several interesting existing work in the literature that yields reasonable performance. In this paper, within the same unsupervised learning setup, we propose a more principled learning framework for the document summarization task. Specifically we formulate an optimization problem that expresses the requirements of both faithful preservation of the document contents and the summary length constraint. We circumvent the difficult integer programming originating from binary sentence selection via continuous relaxation and the low entropy penalization. We also suggest an efficient convex-concave optimization solver algorithm that guarantees to improve the original objective at every iteration. For several document datasets, we demonstrate that the proposed learning algorithm significantly outperforms the existing approaches.

• 대한산업공학회지
• /
• 제41권3호
• /
• pp.296-304
• /
• 2015

Vessel Traffic Service (VTS) is the service that provides ships navigating on a sea transportation route with guidance and advice about geographical environment and other attentive information for their safety. In this study we point out that currently, constructing additional VTSs is required to prevent ships from unexpected accident on their navigation. We first select several candidate locations for constructing VTSs, based on the amount of marine transportation and its potential development possibility. Then, we present an optimization model in which the maximum area coverage is achieved by determining new locations of VTS subject to budget limitation. The problem can be modeled as a binary integer program and it provides an optimal solution for new VTS locations to be constructed under the consideration of the currently located VTSs in Korea.

• 한국통신학회논문지
• /
• 제37B권12호
• /
• pp.1102-1112
• /
• 2012

스마트폰의 급격한 보급에 따른 무선 접속망의 과부하 문제가 네트워크에서 중요한 문제로 부각되고 있다. 이 논문에서는 매크로 셀, 펨토 셀, 와이파이 접속망으로 다양하게 구성되어 있는 현재 이종 네트워크에서 접속망 과부하 문제를 해결하기 위한 최적의 셀 선정 기법과 리소스 할당 기법을 제안한다. 주어진 현재 서비스 부하 상태에서 네트워크가 동시에 추가 수용할 수 있는 사용자 수를 최대화할 수 있는 사용자-셀 간의 선정 기법을 제공한다. 이를 위해 이종 무선 접속망에서의 셀 선정 문제를 이진 정수계획 모형으로 최적화 문제를 수립하고, 이를 최적화 해법 도구를 이용하여 접속망 과부하를 억제할 수 있는 최적의 셀 선정 기법을 도출한다. 네트워크 레벨 시뮬레이션을 통해 이 논문에서 제안된 기법이 현재 무선 접속망에서 주로 사용되고 있는 국소적 셀 선정기법에 비해, 과부하가 걸린 무선 접속망에서 주어진 여러 셀들을 최대한 균등하게 효율적으로 활용함으로써 현저하게 네트워크 접속 장애율을 감소시킬 수 있음을 보인다. 또한 논문에서 사용된 이진 정수계획 모형의 최적화 문제를 푸는 데 소요되는 계산 복잡도에 대한 실험을 통해 제안된 알고리즘의 실용 가능성에 대해서 검증한다.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.48-55
• /
• 2010

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.