• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.4
• /
• pp.138-144
• /
• 2020

The Army's engineers are carrying out a range of operations using various equipment, of which, artillery unit support is the representative engineering operation field. The main task of the artillery unit is to attack the enemy's center with firepower from the rear of a friendly force. The artillery must move its original position after firing several times to prevent exposure of the shooting position. This paper proposed a mathematical model and heuristic algorithm that can be used to determine the optimal allocation among engineer equipment, the team (work), and position while reflecting the constraints of the construction of an artillery position. The model proposed in this paper derived the optimal solution for the small size problems, but it takes a long time to derive the optimal solution for the problem of equipment placement of the engineer battalion and brigade scale. Although the heuristic suggested in this study does not guarantee the optimal solution, the solution could be obtained in a reasonable amount of time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.6
• /
• pp.1389-1398
• /
• 2009

This research suggests the calculation and analytic method of determining the proper numbers of manual workers with simulation and DEA methods. For this, first of all we designed and analysed the simulation model of real facility being built in Dea-Jun. Secondly, we find the solution with DEA among various alternatives built based on the results of the simulation analysis. In the simulation process, the waiting time, the number of painted trains, and utilization of main equipment are considered as main response variables. After simulation, we built DMUs(Decision Making Unit) consisting of combined results with the manpower assignment policies, the numbers of workers, and the rate of skilled operators, and calculated the efficiency of DMUs with the DEA method. Among 27 DMUs, 4 DMUs turned out efficient technically and on scale. In conclusion, through the suggested procedure, this research shows the way that decision makers can solve the problems with various factors they should concern, along the scientific process, when building a new facility.

• 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 Internet Computing and Services
• /
• v.23 no.5
• /
• pp.25-31
• /
• 2022

In ultra dense networks (UDNs), macro user equipments (MUEs) have significant interference from small-cell access points (SAPs) since a number of SAPs are deployed in the coverage of macro base stations of 5G mobile communication systems. In this paper, we propose a dynamic channel assignment scheme to increase the performance of MUEs for the uplink of UDNs even though the number of SAPs is increased. The target of the proposed dynamic channel assignment scheme is that the signal-to-interference and noise ratio (SINR) of MUEs is above a given SINR threshold assigning different subchannels to SUEs from those of MUEs. Simulation results show that the proposed dynamic channel assignment scheme outperforms others in terms of the mean MUE capacity even though the mean SUE capacity is decreased a little lower.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.4-5
• /
• 2014

Planning earthmoving haul-route must be preceded for appropriate equipment fleet assignment. However, traditional haul-route planning methods have limitations relative to practical usage because multiple variables (e.g., grade/rolling resistance, length, equipment's weight etc.) should be considered at a time. Genetic algorithm(GA) was introduced to improve these traditional methods. However, GA based haul-route planning method still remains in inefficiency relative to computation performance. This study presents a new haul-route searching method that computes an optimal haul-route using GA. The system prototype is developed by using MATLAB(ver. 2008b). The system identifies an optimal haul-route by considering equipment type, soil type, and soil condition.

• Journal of the Korea Society for Simulation
• /
• v.7 no.2
• /
• pp.91-104
• /
• 1998

This paper describes the simulation study which evaluates operation plans of container terminal. The operation plans of container terminal consist of berth plan, load plan, unload plan, yard plan, and equipment plan. It is discussed how to apply the simulation method to evaluate those plans that are interrelated with each other. This paper also deals with the assignment and coordination problems of container-handing equipment such as container cranes, transfer cranes, yard tractors, and trailers used in the transportation of containers. Simulation analysis is bases on data about plans from the operation planning system through an interface program. It is discussed what we should got the statistics about container-handing equipment in the simulation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.2
• /
• pp.88-92
• /
• 2021

A method and a mathematical algorithm for finding a quasi-optimal assignment plan with rectangular efficiency matrices are proposed. The developed algorithm can significantly reduce the time and computer memory consumption for its implementation in comparison with optimal methods.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.11-16
• /
• 2020

As a plan for oil spill accidents, research to collect and analyze optimal equipment assignments is essential. However, studies that have diversified and analyzed the optimal equipment assignments for responding to oil spill accidents have not been preceded. In response to the need for analyzing optimal equipment assignments study, we devised a genetic algorithm for optimal equipment assignments. The designed genetic algorithm yielded 10,000 optimal equipment assignments. We clustered using the k-means algorithm. As a result, the two clusters of Yeosu, Daesan, and Ulsan, which are expected to be the largest spills, were clearly identified. We also projected 16-dimensional data in two dimensions via Sammon's mapping. The projected data were analyzed for distribution. We confirmed that results of the simulation were better than those of optimal equipment assignments included in the cluster.In the future, it will be possible to implement an approximate model with excellent performance based on this study.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.157-171
• /
• 1999

In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

• Fashion & Textile Research Journal
• /
• v.14 no.4
• /
• pp.597-606
• /
• 2012

To increase the productivity and product quality of customized baseball jerseys, this study developed a multi-variable system for a production process that efficiently controls diverse production management factors. The working time was measured through the establishment of a standard process where skilled workers and Chinese factory workers manufactured 5 sets of the same basic design jerseys. Based on the measured working time (1,136 seconds/per unit), the multi-variable process control system was developed, where hourly production management is possible according to the involved workers and equipment types. Each process was assigned accoding to the production management factors for a total of 28 standard processes. The processes were developed based on consideration of work characteristics according to the order of needlework of open-type set baseball jerseys with sleeves(the basic design of baseball jerseys)to result in a customized production system structure that could be set up with multi-variables. As a result, a total 12 types of systems were developed in consideration of the personnel involved and the number of equipments. The optimal production management system (with the highest efficiency compared to the number of workers)was A-2, B-1, C-1. D-2, E-2, F-1, and G-1. This system had extremely high efficiency and showed 99% assignment efficiency for the 7-person team. Though not optimal, possible process assignment for each working personnel is proposed as a reserve process in case work modification is inevitable due to malfunctions and the absence of equipments.