• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.188-194
• /
• 2015

This paper proposes a generalized regression neural network (GRNN) based algorithm for data interpolation and design optimization of brushless dc (BLDC) motor. The procedure makes use of magnet length, stator slot opening and air gap length as design variables. Cogging torque and average torque are treated as performance indices. The optimal design necessitates mitigating the cogging torque and maximizing the average torque by varying design variables. The data set for interpolation and ensuing design optimisation using GRNN is obtained by modeling a standard BLDC motor using finite element analysis (FEA) tool MagNet 7.1.1. The performance indices of the standard motor obtained using FEA are validated with an experimental model and an analytical method. The optimal design is authenticated using particle swarm optimization (PSO) algorithm and the performance indices of the optimal design obtained using GRNN is validated using FEA. The results indicate the suitability of GRNN as an interpolation and design optimization tool for a BLDC motor.

• Journal of Korean Society of Water and Wastewater
• /
• v.27 no.4
• /
• pp.413-428
• /
• 2013

In this study, Ant Colony Algorithm(ACO) was used for optimal model. ACO which are metaheuristic algorithm for combinatorial optimization problem are inspired by the fact that ants are able to find the shortest route between their nest and food source. For applying the model to water distribution systems, pipes, tanks(reservoirs), pump construction and pump operation cost were considered as object function and pressure at each node and reservoir level were considered as constraints. Modified model from Ostfeld and Tubaltzev(2008) was verified by applying 2-Looped, Hanoi and Ostfeld's networks. And sensitivity analysis about ant number, number of ants in a best group and pheromone decrease rate was accomplished. After the verification, it was applied to real water network from S water treatment plant. As a result of the analysis, in the Two-looped network, the best design cost was found to $419,000 and in the Hanoi network, the best design cost was calculated to $6,164,384, and in the Ostfeld's network, the best design cost was found to $3,525,096. These are almost equal or better result compared with previous researches. Last, the cost of optimal design for real network, was found for 66 billion dollar that is 8.8 % lower than before. In addition, optimal diameter for aged pipes was found in this study and the 5 of 8 aged pipes were changed the diameter. Through this result, pipe construction cost reduction was found to 11 percent lower than before. And to conclusion, The least cost design model on water distribution system was developed and verified successfully in this study and it will be very useful not only optimal pipe change plan but optimization plan for whole water distribution system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.25
• /
• pp.83-90
• /
• 1992

This paper aims at the problem that design the network of Rig-star type with the minimum cost, which the Ring is composed of the selected nodes(concentrators) among the several candidate nodes on the network and other nodes(terminals) is connected to the Ring by star subnetwork. Especially, we consider the terminal reliability in network design problem. We develop the heuristic algorithm for network design problem to obtain the near optimal(best) solution for problem. We use an add-heuristic method and 2-exchange method in developing the heuristic algorithm.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.55-65
• /
• 2009

The objective of this paper is to propose an ant colony optimization (ACO) for clustering design in wireless sensor network problem. This proposed ACO approach is designed to deal with the dynamics of the sensor nodes which can be adaptable to topological changes to any network graph in a time. Long communication distances between sensors and a sink in a sensor network can greatly consume the energy of sensors and reduce the lifetime of a network. We can greatly minimize the total communication distance while minimizing the number of cluster heads using proposed ACO. Simulation results show that our proposed method is very efficient to find the best solutions comparing to the optimal solution using CPLEX in 100, 200, and 400 node sensor networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.819-824
• /
• 1989

This paper proposes a new method for the discovery and design of an optimal heat exchanger network. The method is based upon the concept of pinch, a problem reduction technique and the heuristics developed in this work. It generates subproblems in a logical way and solves the subproblems by the heuristics to synthesize an optimal network structure. It is thought that the heuristics can preserve the minimum utility consumption, the minimum number of heat exchanger units, and the minimum number of stream splittings needed for a given problem. The minimum heat exchanger area for the optimal network can then be obtained by adjusting the temperatures associate with the heat exchanger in the optimal network structure. The method is applied to the problems appeared in the literatures. The results show the reductions in the number of heat exchanger units for some problems.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.157-166
• /
• 2009

A network design problem (NDP) is to find a design parameter to optimize the performance of transportation system. This paper presents a modified NDP, called target-oriented NDP, which contains a target that we try to arrive in real world, and also proposes a solution algorithm. Unlike general NDP which seeks an optimal value to minimize or to maximize objective function of the system, in target-oriented NDP traffic manager or operator can set a target level prior and then try to find an optimal design variable to attain this goal. A simple example for mode choice problem is given to test the model.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1130-1135
• /
• 2004

The vertical roller mill is the important machine grinding and mixing various crude materials in the manufacturing process of portland cement. Vertical roller mill is subjected to the cyclic bending stress by rollers load. It demands $4{\times}10^7$ cycle but has $4{\times}10^6{\sim}8{\times}10^6$ cycle. It fractures at the edge of grinding path of outside roller. The repair expense for it amounts to 30% of total maintenance. Therefore, this study shows optimal design for vertical roller mill using DOE and neural network.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.972-974
• /
• 1993

This paper presents a new method to automatically design fuzzy logic controller(FLC). The main problems of designing FLC are how to optimally and automatically select the control rules and the parameters of membership function (MF). Cell state space algorithms (CSS), differential competitive learning (DCL) and multialyer neural network are combined in this paper to solve the problems. When the dynamical model of a control process is known. CSS can be used to generate a group of optimal input output pairs(X, Y) used by a controller. The(X, Y) then can be used to determine the FLC rules by DCL and to determine the optimal parameters of MF by DCL and to determine the optimal parameters of MF by multilayer neural network trained by BP algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.107-118
• /
• 2006

In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

• Proceedings of the KIEE Conference
• /
• 2001.10a
• /
• pp.125-127
• /
• 2001

Switched reluctance motor (SRM) has some advantages such as low cost, high torque density etc. However SRM has inevitably high torque ripple due to the double salient structure. To apply SRM to industrial field, we have to minimize torque ripple, which is the weak-Point of SRM. This paper presents optimal design process of SRM using numerical method such as 2D finite element method (FEM) and 3D equivalent magnetic circuit network method (EMCNM). The electrical and geometrical design parameters have been adopted as 2D design variables. The overhang structure of rotor has been also adopted as 3D design variable. From this work, we can obtain the optimal design, which minimize the torque ripple and maximize energy conversion loop.