• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.195-201
• /
• 2007

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.9
• /
• pp.1531-1540
• /
• 2016

In this paper, we propose vehicle license plate recognition system based on Radial Basis Function Neural Networks (RBFNNs) with the use of local binarization functions and canny edge algorithm. In order to detect the area of license plate and also recognize license plate numbers, binary images are generated by using local binarization methods, which consider local brightness, and canny edge detection. The generated binary images provide information related to the size and the position of license plate. Additionally, image warping is used to compensate the distortion of images obtained from the side. After extracting license plate numbers, the dimensionality of number images is reduced through Principal Component Analysis (PCA) and is used as input variables to RBFNNs. Particle Swarm Optimization (PSO) algorithm is used to optimize a number of essential parameters needed to improve the accuracy of RBFNNs. Those optimized parameters include the number of clusters and the fuzzification coefficient used in the FCM algorithm, and the orders of polynomial of networks. Image data sets are obtained by changing the distance between stationary vehicle and camera and then used to evaluate the performance of the proposed system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.5
• /
• pp.705-711
• /
• 2013

In this paper, we introduce an design of multi-output fuzzy neural networks based on Interval Type-2 fuzzy set. The proposed Interval Type-2 fuzzy set-based fuzzy neural networks with multi-output (IT2FS-based FNNm) comprise the network structure generated by dividing the input space individually. The premise part of the fuzzy rules of the network reflects the individuality of the division space for the entire input space and the consequent part of the fuzzy rules expresses three types of polynomial functions with interval sets such as constant, linear, and modified quadratic inference for pattern recognition. The learning of fuzzy neural networks is realized by adjusting connections of the neurons in the consequent part of the fuzzy rules, and it follows a back-propagation algorithm. In addition, in order to optimize the network, the parameters of the network such as apexes of membership functions, uncertainty factor, learning rate and momentum coefficient were automatically optimized by using real-coded genetic algorithm. The proposed model is evaluated with the use of numerical experimentation.

• Journal of Distribution Science
• /
• v.15 no.7
• /
• pp.35-41
• /
• 2017

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2686-2708
• /
• 2020

This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.3
• /
• pp.308-313
• /
• 2015

In this research, a multi-objective optimal design of a scroll compressor lower frame was approximated, and the design parameters of the lower frame were selected. The sensitivity of the design parameters was induced through a parameter analysis, and the thickness was determined to be the most sensitive parameter to stress and deflection. All of the design parameters regarding the mass are sensitive factors. It was formulated for the problem about stress and deflection to be caused by the axial load. The sensitivity of the design variables was determined using an orthogonal array for the parameter analysis. Using the central composite and D-optimal designs, a second polynomial approximation of the objective and constraint functions was formulated and the accuracy was verified through an R-square. These functions were applied to the optimal design program (NSGA-II). Through a CAE analysis, the effectiveness of the central composite and D-optimal designs was determined.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.26 no.5
• /
• pp.866-871
• /
• 1997

This study was carried out to determine the effect of osmotic dehydration as pretreatment on the qualities of dried cherry-tomatoes. The weight reduction and solid gain in osmosed cherry-tomato were increased by increasing sugar concentration, immersion temperature and time; among three parameters, the immersion temperature affected more than sugar concentration and immersion time did. The moisture content was decreased as increasing sugar concentration, immersion temperature and time, and it was the lowest at the osmotic conditions of 7$0^{\circ}C$, 60$^{\circ}$Brix and 11hr. To determine the optimum processing condition by RSm, the polynomial optimum models were established. The regression models was significant (p<0.05). It was used contour plots to optimize osmotic dehydration. The optimum condition for osmotic dehydration as pretreatments for drying of cherry-tomatoes were immersion temperature of 47~53$^{\circ}C$, sugar concentration of 39~43$^{\circ}$Brix, and immersion time of 7hr, in which process conditions were 78~86% moisture content, 8.5~10$^{\circ}$Brix sugar content and 80~86% weight reduction.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.6
• /
• pp.797-803
• /
• 2014

In this paper, 3D face recognition system is designed by using polynomial based on RBFNNs. In case of 2D face recognition, the recognition performance reduced by the external environmental factors such as illumination and facial pose. In order to compensate for these shortcomings of 2D face recognition, 3D face recognition. In the preprocessing part, according to the change of each position angle the obtained 3D face image shapes are changed into front image shapes through pose compensation. the depth data of face image shape by using Multiple Point Signature is extracted. Overall face depth information is obtained by using two or more reference points. The direct use of the extracted data an high-dimensional data leads to the deterioration of learning speed as well as recognition performance. We exploit principle component analysis(PCA) algorithm to conduct the dimension reduction of high-dimensional data. Parameter optimization is carried out with the aid of PSO for effective training and recognition. The proposed pattern classifier is experimented with and evaluated by using dataset obtained in IC & CI Lab.