• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.63-77
• /
• 2008

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. Hierarchical network design using genetic algorithm is the first three-tier (Macro, Micro, Pico) model. We increase the reality through applying to Electromagnetic Compatibility Constraints. Computational experiments on 72 problem instances which have $15{\sim}40$ candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers 90% of the demand.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.211-220
• /
• 2017

The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1360-1364
• /
• 2004

This paper propose an extended model for role-permission assignment based on locations called "Enhanced Role-Based Access Control (ERBAC03)". The proposed model is built upon the well-known RBAC model. Assigning permissions to role is considered too complex activity to accomplish directly. Instead we advocate breaking down this process into a number of steps. The concept of jobs and tasks is specifically introduced to facilitate role-permission assignment into a series of smaller steps. This model is suitable for any large organization that has many branches. Each branch consists of many users who work in difference roles. An administration tool has been developed to assist administrators with the administration of separation of duty requirements. It demonstrates how the specification of static requirements can be done based on "conflicting entities" paradigm. Static separation of duty requirements must be enforced in the administration environment. Finally, we illustrate how the ERBAC03 prototype is used to administer the separation of duty requirements.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.193-199
• /
• 2009

Recently, an industrial production-distribution planning problem has been widely investigated in Supply Chain Management(SCM). One of the key issues in the current SCM research area is reverse logistics network. This study have developed a simulation model for the reverse logistics network. The simulation model analysis reverse logistics network issues such as inventory policy, manufacturing policy, transportation mode, warehouse assignment, supplier assignment. Computational experiments using commercial simulation tool ARENA show that the real problems. The model can be used to decide an appropriate production-distribution planning problem in the research area.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.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.

• Journal of Korean Society for Quality Management
• /
• v.36 no.1
• /
• pp.40-48
• /
• 2008

The purpose of this study is to rationally manage service facilities of convention center. This study is to develop the algorithm to consider optimal assignment and optimal operation system planning for convention center. The scheduling algorithm of this study develops through constructing the mathematical model and analyzing the mathematical structure of variables and constraints in model. The scheduling algorithm develops to consist eight stage of optimal operation planning and five stage of optimal assignment planning. Especially, this study indicates that optimum answer through mathematical model and results of algorithm is nondiscrimination.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.63-80
• /
• 2007

This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.11-24
• /
• 1992

The performance of Storage assignment policies is traditionally evaluated with the storage capacity of and AS/RS taken as given. However, the storage capacity is closely related to the inventory model used in real situations. This paper presents a model of evaluating the performance of three storage policies(random storage, class-based storage, and full turnover-based storage) considering production lot-sizing simultaneously with storage assignment of inventory items. The objective of the model is to achieve a balance of warehouse throughput and space requirements such that a total of material handling cost, production ordering cost, and inventory holding cost is minimized. The effects of the parameters involved in the model are investigated on the performance of each storage policy through example problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.66
• /
• pp.91-98
• /
• 2001

In this study, a heuristic for surface mounters is developed to find an efficient sequence on PCB and rack assignment by component grouping. As setting up 4 reels in a group, the distance of rack moving can be minimized. And then, a generalized model for N reels in a group is developed. It is found that the performance of this heuristic is better than other heuristics found in the literature. Throughout the simulation study, the suggested heuristic is performed about 8.2 ∼ 12% better than other heuristics.