• Journal of the Korea Society for Simulation
• /
• v.29 no.4
• /
• pp.47-54
• /
• 2020

North Korea has recently developed and deployed missiles with various ranges as asymmetrical forces. Among them, short-range ballistic missiles with improved accuracy are expected to aim at achieving tactical goals by hitting important military facilities in Korea with a small number of missiles. Damage to the air force airfields, one of North Korea's main targets of missiles attack, could limit the operation of air force fighters essential to gaining air superiority. Based on the attack by the short range ballistic missiles, the damage probability of military airfields was simulated. And as the one of the concepts of passive defense, the way to reduce the loss of combat power was studied through the changes of the air force squadrons deployment. As a result, the effective deployment plan could be obtained to reduce the amount of power loss compared to the current deployment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.32-42
• /
• 2021

The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.

• Journal of Navigation and Port Research
• /
• v.46 no.3
• /
• pp.236-242
• /
• 2022

Busan Port is operated separately by a number of terminal operators, resulting in a large number of ITT (Inter-Terminal Transportation) volumes. The occurrence of ITT volume causes various problems such as additional transportation cost, empty truck trips, truck delays and terminal congestion, weakening Busan Port's competitiveness. Among them, the empty truck trip problem is a representative factor, that exacerbates the cost problem of the ITT operation at Busan Port. But the ITT backhaul rate at Busan Port remains low. To strengthen the transhipment competitiveness of Busan Port, it is necessary to increase the ITT backhaul rate. In this paper, to improve ITT backhaul rate, we present a mathematical model for maximizing backhaul transport using buffer space. And we analyzed the improving effects of backhaul transport using buffer space through experiments based on actual operating data.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.19-27
• /
• 2009

This paper addresses the berth allocation problem in naval ports. Navy vessels need various services such as emergency repair, missile loading, oil supply and many others while commercial vessels only unload and load container at the port. Furthermore, naval vessels have to shift frequently due to a limited capacity of the port. The objective of this paper is to minimize the total number of nesting vessels at the naval port. In other word, the objective is to maximize the total number of naval battleships engaging in the sea. A mixed integer programming(MIP) model is developed and experiments are conducted with ILOG CPLEX 11.0. We compare the computational results of the MIP model to the current scheduling approach by the ROK Navy. The results showed that MIP model performed well by minimizing the number of nesting vessels. and avoiding unnecessary shifts.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.161-168
• /
• 2009

In this paper, we studied about an consolidated transportation model to transport EOL (end-of-life) electronic household appliances for recycling in South Korea. The objective is to minimize the total traveling distance of the vehicles transporting EOL electronic household appliances collected by local authorities and major manufacturers' distribution centers to assigned R/C(recycling center) in South Korea. Current reverse logistics for recycling EOL electronic household appliances is operated by local authorities and major manufacturers individually, and it is inefficient for the following reasons: excessive traveling distance, transportation cost, low truck capacity utilization, and so on. The presented model is developed to solve this problem. We apply a integer programming to solve this problem and present computational results using actual field data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1823-1840
• /
• 2023

In order to improve spectral efficiency and reduce power consumption for reconfigurable intelligent surface (RIS) assisted wireless communication systems, a joint design considering irregular RIS topology, RIS on-off switch, power allocation and phase adjustment is investigated in this paper. Firstly, a multi-dimensional variable joint optimization problem is established under multiple constraints, such as the minimum data requirement and power constraints, with the goal of maximizing the system energy efficiency. However, the proposed optimization problem is hard to be resolved due to its property of nonlinear nonconvex integer programming. Then, to tackle this issue, the problem is decomposed into four sub-problems: topology design, phase shift adjustment, power allocation and switch selection. In terms of topology design, Tabu search algorithm is introduced to select the components that play the main role. For RIS switch selection, greedy algorithm is used to turn off the RISs that play the secondary role. Finally, an iterative optimization algorithm with high data-rate and low power consumption is proposed. The simulation results show that the performance of the irregular RIS aided system with topology design and RIS selection is better than that of the fixed topology and the fix number of RISs. In addition, the proposed joint optimization algorithm can effectively improve the data rate and energy efficiency by changing the propagation environment.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.89-97
• /
• 2004

The Korea Air Force(KAF) has operated freight flights based on the prefixed time and route schedule, which is adjusted once in a month. The major purpose of the operation of freight flights in the KAF is to distribute necessary supplies from the home air base to other air bases. The secondary purpose is to train the young pilots to get more experiences in navigation. Each freight flight starts from and returned to the home air base everyday except holidays, while it visits several other air bases to accomplish its missions. The study aims to forecast freight demand at each base by using time series analysis, and then it tried to optimize the cost of operating flights by solving vehicle routing problem. For more specifically, first, several constraints in operating cargos were defined by reviewing the Korea Air Force manuals and regulation. With such constraints, an integer programming problem was formulated for this specific routing problem allowing several visits in a tour with limitation of maximum number of visits. Then, an algorithm to solve the routing problem was developed. Second, the time series analysis method was applied to find out the freight demand at each air base from the mother air base in the next month. With the forecasted demands and the developed solution algorithm, the oprimum routes are calculated for each flight. Finally, the study compared the solved routing system by the developed algorithm with the existing routing system of the Korea Air Force. Through this comparison, the study proved that the proposed method can provide more (economically) efficient routing system than the existing system in terms of computing and monetary cost. In summary, the study suggested objective criteria for air routing plan in the KAF. It also developed the methods which could forecast properly the freight demands at each bases by using time series analysis and which could find the optimum routing which minimizes number of cargo needed. Finally, the study showed the economical savings with the optimized routing system by using real case example.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.324-334
• /
• 2017

The simulators for a plant unit master control (UMC) developed by domestic or overseas researchers have been developed for operator-training purposes. UMC simulators normally constructed at the end of the plant construction, despite the UMC logics, should be simulated to pre-check many signal interfaces within the power generation systems. Because of the differences in construction schedule, it is difficult for logic designers or commissioning engineers to simulate the UMC logic during the design or commissioning stage. In this background, this paper proposes a simulation method that can be used easily by plant logic designers or operators in the MATLAB Simulink programming environment. The core of the UMC is realized with a unique simulation algorithm based on mathematical analysis and functional blocks combination. In addition, an integer-based configuration was proposed to realize the plant target value control for the equipment in the logic. With these simulation methods, functions, e.g., load distribution, high-low limitations, frequency compensation, etc. were simulated. The results showed that the plant UMC logic can be simulated in Simulink without a plant simulator. The various functions proposed in this paper can provide useful information about Simulink-based simulation design for plant logic designers or commissioning engineers during the power plant construction period.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 1999.05a
• /
• pp.539-563
• /
• 1999

이 논문은 정보통신정책 목표와의 연관성 속에서 정보통신연구개발사업의 우선순위를 설정함과 아울러 비용효과성에 바탕을 둔 적정 자원배분 도출하는데 주안점을 두고 있다. 복합적인 목표를 가진 연구개발사업에 대해 사업부문별 그리고 기술분야별로 객관적이면서도 설득력있는 자원배분지침을 마련하기 위하여 본 연구는 다기준의사결정(MCDA: Multi-criteria Decision Analysis) 방법을 채택하고 있다. 이 방법론에서는 사업의 목표와 우선순위 판단기준 및 사업대안이 계층적으로 연계된 분석구조를 설계하여 사업대안의 우선순위를 먼저 설정하고, 여기에 정수계획법(Integer Programming)을 결합하여 사업의 목표와 연계된 비용-편익 관계(Cost-benefit relationship)를 최적화하는 바탕 위에서 사업대안별 자원배분 시나리오를 제시하게 된다. 이러한 절차로 사업부문별 및 기술분야별로 각각 도출된 8개의 자원배분 시나리오는 자원배분 경향치의 안정성(Stability) 분석과 자금지원의 과부족에 대한 현실적 적합성(Relevance) 분석을 거쳐 최종적으로 하나의 적정 자원배분방안으로 수렴되도록 하였다. 우선순위 설정에 기초가 되는 사업대안의 편익에 대한 자료는 전문가의 정성적 판단을 통해 수집되었는데, 이를 위해 정보통신기술 부문에서 활동 중인 중견 이상의 총 58명의 산학연 전문가를 대상으로 한 조사를 실시하였다. 먼저, 기초기반ㆍ전략기술개발사업, 연구ㆍ기술인력양성사업, 산업응용기술개발사업, 기술기반조성사업 등 4대 사업부문에 대해서는 (ⅰ) 정보통신 기술능력의 축적, (ⅱ) 정보통신산업의 경쟁력 강화, (ⅲ) 정보통신기반의 기술고도화, (ⅳ) 정보화를 위한 기술역량의 제고 등 주요 사업의 편익을 나타내는 4개 기준으로 우선 순위를 판단하였고, 정보통신망기술, 전파 및 RF 기술, 정보처리기술, 반도체 소자/설계 기술 등 13개 기술분야에 대해서는 (ⅰ) 공공정책적 임무에 대한 기여, (ⅱ) 기술자립기반의 확충, (ⅲ) 기술발전성과 기술적 파급효과, (ⅳ) 기술적 산물의 시장잠재력 등 기술분야 연구개발을 통한 편익을 나타내는 4개 기준으로 우선순위를 판단하였다. 우선순위는 사업대안에 대한 가중치로 표시되었고, 적정 자원배분방안은 추정된 총예산 규모에 따라 지원수준에 대한 일정한 제약조건 하에서 비용-편익 관계에 따른 자원의 최적 할당량으로 제시되었다. 본 연구는 총예산 규모의 가변성, 사업 및 기술분야 대안의 분류체계에 대한 공감대 부족, 사업목표의 상호연관성과 우선순위 판단기준의 부분적 중첩성 등 여러 제약요인이 있어 도출된 구체적인 수치보다는 방향성에 더 큰 의미를 부여하는 것이 바람직하다. 그러나, 이러한 연구의 한계에도 불구하고 도출된 우선순위와 적정 자원배분방안은 문제해결의 실행타당성을 감안하여 비교적 객관적이고 균형있는 결과로 판단된다.