• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.476-480
• /
• 2010

This study deals with stockout costs in the supply chain optimization model under the framework of batch-storage network. Stockout is very popular in chemical industries. Estimating stockout cost involves an understanding of customer reactions to a seller being out of stock at the time the customer wants to buy an item. This involves massively non-trivial work such as direct customer interviews and extensive mail survey. In this study, we will introduce a new interpretation of stockout costs combined with batchstorage network optimization model and thus suggest an easy way of estimating stockout costs. Optimization model suggest that optimal process and storage sizes considering stockout cost are smaller than those that do not consider stockout cost. An illustrative example support the analytical results.

• Journal of the Korean Society of Industry Convergence
• /
• v.22 no.2
• /
• pp.87-93
• /
• 2019

This research deals with posture optimization for humanoid robot against external forces using genetic algorithm and neural network. When the robot takes a motion to push an object, the torque of each joint is generated by reaction force at the palm. This study aims to optimize the posture of the humanoid robot that will change this torque. This study finds an optimized posture using a genetic algorithm such that torques are evenly distributed over the all joints. Then, a number of different optimized postures are generated from various the reaction forces at the palm. The data is to be used as training data of MLP(Multi-Layer Perceptron) neural network with BP(Back Propagation) learning algorithm. Humanoid robot can find the optimal posture at different reaction forces in real time using the trained neural network include non-training data.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.282-289
• /
• 2007

While demands for express couriers service are rapidly increasing due to recent progress of electronic commerce, express courier service companies are struggling to take a larger market share through ongoing improvement in their service processes. Cut-off time is the time limit that all orders delivered before the limit are guaranteed for the delivery within the very next day. Extending cut-off time for express service centers can provide the express company with increase of total sales, but it may also cause increasing the possibility not to satisfy customer needs due to work delay in the consolidation terminal. We develop a design model for express courier service network based on a recursive optimization/simulation procedure. With the optimization model, we seek key design parameters such as the cut-off time for express service centers and the capacity of the consolidation terminal maximizing total sales profit while satisfying the desired level of performances. With the simulation model, we consider the dynamic nature of the network and obtain relationships between the design parameters and the performance measures with the multiple linear regression. The validity of the model is examined with an example.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.1086-1092
• /
• 2002

Computer simulation is essential to design the suspension elements of railway vehicle. By computer simulation, engineers can assess the feasibility of a given design factors and change them to get a better design. But if one wishes to perform complex analysis on the simulation, such as railway vehicle dynamic, the computational time can become overwhelming. Therefore, many researchers have used a mega model that has a regression model made by sampling data through simulation. In this paper, the neural network is used a mega model that have twenty-nine design variables and forty-six responses. After this mega model is constructed, multi-objective optimal solutions are achieved by using the differential evolution. This paper shows that this optimization method using the neural network and the differential evolution is a very efficient tool to solve the complex optimization problem.

• Journal of Digital Contents Society
• /
• v.18 no.5
• /
• pp.969-976
• /
• 2017

This paper proposes the learning method of an artificial neural network and a convolutional neural network using the WFSO algorithm developed as an optimization algorithm. Since the optimization algorithm searches based on a number of candidate solutions, it has a drawback in that it is generally slow, but it rarely falls into the local optimal solution and it is easy to parallelize. In addition, the artificial neural networks with non-differentiable activation functions can be trained and the structure and weights can be optimized at the same time. In this paper, we describe how to apply WFSO algorithm to artificial neural network learning and compare its performances with error back-propagation algorithm in multilayer artificial neural networks and convolutional neural networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1023-1033
• /
• 2007

This study considers a joint congestion control, routing and power control for energy-constrained wireless networks. A mathematical model is introduced which includes maximization of network utility, maximization of network lifetime, and trade-off between network utility and network lifetime. The framework would maximize the overall throughput of the network where the overall throughput depends on the data flow rates which in turn is dependent on the link capacities. The link capacity on the other hand is a function of transmit power levels and link Signal-to-Interference-plus-Noise-Ratio (SINR) which makes the power allocation problem inherently difficult to solve. Using dual decomposition techniques, subgradient method, and logarithmic transformations, a joint algorithm for rate and power allocation problems was formulated. Numerical examples for each optimization problem were also provided.

• Structural Engineering and Mechanics
• /
• v.7 no.5
• /
• pp.485-502
• /
• 1999

Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.87-94
• /
• 2001

Silicon nitride films grown by plasma-enhanced chemical vapor deposition (PECVD) are useful for a variety of applications, including anti-reflecting coatings in solar cells, passivation layers, dielectric layers in metal/insulator structures, and diffusion masks. PECVD systems are controlled by many operating variables, including RF power, pressure, gas flow rate, reactant composition, and substrate temperature. The wide variety of processing conditions, as well as the complex nature of particle dynamics within a plasma, makes tailoring SiN film properties very challenging, since it is difficult to determine the exact relationship between desired film properties and controllable deposition conditions. In this study, SiN PECVD modeling using optimized neural networks has been investigated. The deposition of SiN was characterized via a central composite experimental design, and data from this experiment was used to train and optimize feed-forward neural networks using the back-propagation algorithm. From these neural process models, the effect of deposition conditions on film properties has been studied. A recipe synthesis (optimization) procedure was then performed using the optimized neural network models to generate the necessary deposition conditions to obtain several novel film qualities including high charge density and long lifetime. This optimization procedure utilized genetic algorithms, hybrid combinations of genetic algorithm and Powells algorithm, and hybrid combinations of genetic algorithm and simplex algorithm. Recipes predicted by these techniques were verified by experiment, and the performance of each optimization method are compared. It was found that the hybrid combinations of genetic algorithm and simplex algorithm generated recipes produced films of superior quality.