• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.179-186
• /
• 1996

Previous researches on optimum ALT plans have shown how to find optimum allocation, lowest stress and sample size subject to minimizing the variance of mean life estimate. Those researches have assumed the censoring time constant. But under certain circumstances such assumptions may not be reasonable. In this paper the constraint on constant censoring time is relaxed, and censoring time is considered variable. If all other test parameters remain unvaried, the variance of the mean life estimate reciprocally increases of the censoring time. This idea in this paper extends to the optimum censoring time. Thus, this paper presents the optimal censoring time in such situations, and finds the optimal lowest stress and allocation based on that optimal censoring time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.

• IE interfaces
• /
• v.18 no.4
• /
• pp.370-381
• /
• 2005

This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

• Journal of environmental and Sanitary engineering
• /
• v.18 no.3 s.49
• /
• pp.11-20
• /
• 2003

There are two ways of reducing air pollution. One is the approach of the pollutant source control and the other one is the traffic demand decreasing approach. This study is focusing on the approach of land use planning and optimal location of urban facilities because those are the basic cause to generate transportation demands. So, the purpose of this study would be to analyze the changes of NOx and CO distribution on environmental air by functional hierarchy of urban roads and to make evaluation model of 'Transportation-Land Use -Air Pollution'. It will contribute to improve the air pollution level at same actual traffic generation according to different location.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1386-1396
• /
• 2017

In this paper, a new approach is proposed to select the optimal sitting and sizing of distributed solar photovoltaic generation (SPVG) in a radial electrical distribution systems (EDS) considering load/generation uncertainties. Here, distributed generations (DGs) allocation problem is modeled as optimization problem with network loss based objective function under various equality and inequality constrains in an uncertain environment. A boundary power flow is utilized to address the uncertainties in load/generation forecasts. This approach facilitates the consideration of random uncertainties in forecast having no statistical history. Uncertain solar irradiance is modeled by beta distribution function (BDF). The resulted optimization problem is solved by a new Dynamic Harmony Search Algorithm (DHSA). Dynamic band width (DBW) based DHSA is proposed to enhance the search space and dynamically adjust the exploitation near the optimal solution. Proposed approach is demonstrated for two standard IEEE radial distribution systems under different scenarios.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.38-50
• /
• 2005

The current Air defense missile, Nike, will be replaced by the Patriot missile in the near future. In this paper, we developed an optimal allocation model for the Patriot missile. In order to formulate the model, we applied a set covering and If model. This model considers not only weapon's characteristics and performances but also the threat of enemy aircrafts and SCUD missiles. When we apply this model, we can find the optimal location of Patriot batteries which maximizes the kill probability of enemy aircrafts and SCUD missiles attacking vital area of our forces. This model can directly be used to the decision making for the optimal military facility allocation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.223-232
• /
• 1998

In order to improve the hospital service quality, some hospitals try to reduce the outpatients' waiting time in the hospital. One of the dissatisfied service items at the hospital is the long waiting time to take the prescribed medicine. In most cases, the smaller the number of pharmacists, the longer could be the waiting time. The suggestion of criteria for optimal allocation of appropriate number of pharmacists must be very important to manage the hospital pharmacy. In this paper, we suggest the method to figure out appropriate number of pharmacists through the real situation study at the Sampling Medical Center Pharmacy. We present the simulation study results using the simulation package ARENA and the analysis of statistical distribution of the arriving prescriptions. The result of this research could be applied to the other service business to figure out the optimal allocation of available human resources and to do the job analysis for better service quality.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.1
• /
• pp.40-43
• /
• 2005

This paper presents the minimization of the fuel cost by optimal allocation of P-Q generation in a three-bus sample system. Derivation of the system loss sensitivities by optimization technique is introduced. The loss sensitivities are substituted into the optimality conditions and the optimal P-Q allocation is computed to obtain the minimal fuel cost.

• Journal of Korea Multimedia Society
• /
• v.18 no.2
• /
• pp.168-177
• /
• 2015

To increase the overall utility and decrease the link delay and power consumption, a joint optimal cross-layer design of congestion control at the transport layer, link delay at the data link layer and power allocation at the physical layer for mobile ad hoc networks is considered in this paper. As opposed to previous work, the rate outage probability in this work is based on exactly closed-form; therefore, the proposed method can guarantee the globally optimal solutions to the underlying problem. The non-convex formulated problem is transformed into a convex one, which is solved by exploiting the duality technique. Finally, simulation results verify that our proposal achieves considerable benefits over the existing method.