• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.93-102
• /
• 2013

This paper proposes an algorithm designed to obtain the optimal solution for transportation problem. The transportation problem could be classified into balanced transportation where supply meets demand, and unbalanced transportation where supply and demand do not converge. The archetypal TSM (Transportation Simplex Method) for this optimal solution firstly converts the unbalanced problem into the balanced problem by adding dummy columns or rows. Then it obtains an initial solution through employment of various methods, including NCM, LCM, VAM, etc. Lastly, it verifies whether or not the initial solution is optimal by employing MODI. The abovementioned algorithm therefore carries out a handful of complicated steps to acquire the optimal solution. The proposed algorithm, on the other hand, skips the conversion stage for unbalanced transportation problem. It does not verify initial solution, either. The suggested algorithm firstly allocates resources so that supply meets demand, in the descending order of its loss cost. Secondly, it optimizes any surplus quantity (the amount by which the initially allocated quantity exceeds demand) in such a way that the loss cost could be minimized Once the above reallocation is terminated, an additional arrangement is carried out by transferring the allocated quantity in columns with the maximum cost to the rows with the minimum transportation cost. Upon application to 2 unbalanced transportation data and 13 balanced transportation data, the proposed algorithm has successfully obtained the optimal solution. Additionally, it generated the optimal solution for 4 data, whose solution the existing methods have failed to obtain. Consequently, the suggested algorithm could be universally applied to the transportation problem.

• Journal of Nutrition and Health
• /
• v.38 no.6
• /
• pp.455-464
• /
• 2005

The study was designed to observe the correlation between the eating habits and growth development in 1,574 children (3-6 years old) in Kyunggi-do and Seoul, Korea. The eating habits and nutrient intake were determined by mini dietary assessment and food frequency questionnaire (FFQ). 35.6% children had been practicing an unbalanced diets. Children with unbalanced diet consumed less amount of protein source foods (meat, fish, egg, soy products), vegetables and fruits and had irregular meal time, but more of them preferred sweet foods (ice creme, cookies) and carbonated drinks as snack compared with children in balanced diet. 24-35% children consumed energy, iron (Fe), calcium (Ca), Niacin, Zinc (Zn) less than 75% RDA. Energy intake of children with unbalanced diet was not significantly different from those with balanced diet, but they consumed less amount of niacin, Fe, Ca and Zn than those with balanced diet. By using the relative percentage of standard weight-length-index (WLI), 65.7% children was normal weight, 12.9% was underweight, 13.4% was overweight and 7.9% was obese. However, 11.9% of underweight and normal weight children was so called thin obese since their body fat content was greater than 20%. There were 16.8% underweight in children with unbalanced diet and 12.6% underweight in those with balanced diet. Compared to normal weight, the underweight children significantly consumed less amount of milk and its product, high protein foods, fried foods and fruits, but obese children consumed more high protein source foods (meat, fish, egg, etc) and sweet foods. In conclusion, the eating habits of unbalanced meal was prevalent problem in preschool children which resulting in their health risks. Therefore, it would be needed that new approach for nutrition education to improve eating habits in preschoolers.

• Design & Manufacturing
• /
• v.12 no.3
• /
• pp.55-59
• /
• 2018

In a multi-cavity mold having a runner layout of a fish bone structure, problems of unbalanced filling between cavities occur constantly. Unbalanced charging lowers the dimensional accuracy of a molded article and causes deformation after molding. To solve this problem, the gate size connected to each cavity is adjusted using the BGV (Balanced Gate Value) equation. In this paper, in order to solve the filling imbalance problem of the runner layout mold of fish bone structure through injection molding analysis study, we compared the charging imbalance phenomenon before and after improvement after adjusting the gate size by applying BGV equation. From the results of the molding analysis, the shrinkage ratio before and after the improvement of the molded article was improved by only about 0.08%. Based on these results, it was confirmed that the charging imbalance problem was not significantly improved even when the BGV equation was applied.

• The Korean Journal of Applied Statistics
• /
• v.28 no.3
• /
• pp.495-509
• /
• 2015

We study a classification problem of significant differences in the proportion of two groups known as the unbalanced classification problem. It is usually more difficult to classify classes accurately in unbalanced data than balanced data. Most observations are likely to be classified to the bigger group if we apply classification methods to the unbalanced data because it can minimize the misclassification loss. However, this smaller group is misclassified as the larger group problem that can cause a bigger loss in most real applications. We compare several classification methods for the unbalanced data using sampling techniques (up and down sampling). We also check the total loss of different classification methods when the asymmetric loss is applied to simulated and real data. We use the misclassification rate, G-mean, ROC and AUC (area under the curve) for the performance comparison.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.139-147
• /
• 2012

This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.12
• /
• pp.71-77
• /
• 2010

A discontinuity of magnetic circuits according to the end effect is generated in PMLSM. And magnetic state of the 3 phase coils becomes unbalanced. Due to the unbalanced magnetic state, the unbalanced flux linkage, back electro-magnetic force and inductance of the 3 phase coils appear. In result, the circulating current is generated by unbalanced inductance even if the input voltages are in balanced state. Then the thrust and efficiency are decreased because of the circulating current. Therefore, in this paper, the unbalanced inductance and the thrust reduction according to discontinuity of magnetic circuits are analyzed by FEA(2D). To demonstrate the validity of the analysis results, the experiment results are compared with analysis results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.163-171
• /
• 2013

This paper proposes an algorithm that seeks the optimal solution for an assignment problem through a simplified process. Generally it is Hungarian algorithm that is prevalently used to solve a given assignment problem. The proposed algorithm reduces 4 steps Hungarian algorithm into 2 steps. Firstly, the algorithm selects the minimum cost from a matrix and deletes the rest of the rows and columns. Secondly, it improves on the solution through reassignment process. For 27 balanced assignment problems and 7 unbalanced problems, the proposed algorithm has successfully yielded the optimal solution, which Genetic algorithm has failed. This algorithm is thus found to be an appropriate replacement of Hungarian algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.2
• /
• pp.215-222
• /
• 2013

Electrical power distribution systems are critical links between the utility and customer. In general, power distribution systems have unbalanced feeders due to the unbalanced loading. The devices that dependent on balanced three phase supply are affected by the unbalanced feeders. This necessitates the balancing of feeders. The main objective of reconfiguration is to balance the loads among the phases subject to constraints such as load flow equations, capacity and voltage constraints and to reduce the real power loss, while subject to a radial network structure in which all loads must be energized. Therefore, the distribution system reconfiguration problem has been viewed as multi-objective problem. In this paper, the hybrid heuristic algorithm has been used for reconfiguration, which is the combination of fuzzy and greedy algorithms. The purpose of the introduction of greedy is to refrain the searching for the period of phase balancing. The incorporation of fuzzy helps to take up more objectives amid phase balancing in the searching. The effectiveness of the proposed method is demonstrated through modified IEEE 33 bus and modified IEEE 125 bus radial distribution system.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.28 no.1
• /
• pp.22-29
• /
• 2023

A grid-connected inverter can be used in grid-connected or stand-alone modes. Generally, a grid-connected inverter operates in a grid-connected mode, but the inverter operates in stand-alone mode if grid faults occur. In the stand-alone mode, the grid-connected inverter must supply electric power to a critical load that needs to receive stable power even though grid faults occur. Generally, three-phase loads are used as critical loads, but a single phase is configured in some cases. In these conditions, the critical load is required to unbalance the load power consumption, which makes the three-phase load voltage unbalancd. This unbalanced voltage problem can cause fatal problems to the three-phase critical loads, and thus must be addressed. Hence, this paper proposes an algorithm to solve this unbalanced voltage problem by the individual phase current control. The proposed method is verified using Psim simulation and experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.