• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.3
• /
• pp.253-258
• /
• 2005

In this study, we introduce a new category of fuzzy inference systems based on information granulation to carry out the model identification of complex and nonlinear systems. Informal speaking, information granules are viewed as linked collections of objects (data, in particular) drawn together by the criteria of proximity, similarity, or functionality. To identify the structure of fuzzy rules we use genetic algorithms (GAs). Granulation of information with the aid of Hard C-Means (HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms and the least square method (LSM). The proposed model is contrasted with the performance of the conventional fuzzy models in the literature.

• Journal of Korean Society for Quality Management
• /
• v.8 no.1
• /
• pp.3-7
• /
• 1980

In many industrial processes, there are more than two responses (i.e., yield, percent impurity, etc.) of interest, and it is desirable to determine the optimal levels of the factors (i.e., temperature, pressure, etc.) that influence the responses. Suppose the response relationships are assumed to be approximated by second-order polynomial regression models. The problems considered in this paper is, first, to propose how to select polynomial terms to fit the multivariate regression surfaces for a given set of data, and, second, to propose how to analyze the data to obtain an optimal operating condition for the factors. The proposed techniques were applied for empirical process optimization in a tire company in Korea. This case is presented as an illustration.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.730-735
• /
• 2005

Though Knapsack Problem appears to be simple, it is a NP-hard problem that is not solved in polynomial time as combinational optimization problems. To solve this problem, GA(Genetic Algorithms) was used in the past. However, there were difficulties in real experiments because the conventional method didn't reflect the precise characteristics of DNA. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve problems of Knapsack Problem. ACO was applied to (0,1) Knapsack Problem; as a result, it reduced experimental errors as compared with conventional methods, and found accurate solutions more rapidly.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.127-135
• /
• 2000

Emergent computing paradigms such as genetic algorithms have found increased use in problems in engineering design. These computational tools have been shown to be applicable in the solution of generically difficult design optimization problems characterized by nonconvexities in the design space and the presence of discrete and integer design variables. Another aspect of these computational paradigms that have been lumped under the bread subject category of soft computing, is the domain of artificial intelligence, knowledge-based expert system, and machine learning. The paper explores a machine learning paradigm referred to as teaming classifier systems to construct the high-quality global function approximations between the design variables and a response function for subsequent use in design optimization. A classifier system is a machine teaming system which learns syntactically simple string rules, called classifiers for guiding the system's performance in an arbitrary environment. The capability of a learning classifier system facilitates the adaptive selection of the optimal number of training data according to the noise and multimodality in the design space of interest. The present study used the polynomial based response surface as global function approximation tools and showed its effectiveness in the improvement on the approximation performance.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.6
• /
• pp.415-424
• /
• 2004

In this paper, we introduce and investigate a new category of rule-based fuzzy inference system based on Information Granulation(IG). The proposed rule-based fuzzy modeling implements system structure and parameter identification in the efficient form of “If..., then...” statements, and exploits the theory of system optimization and fuzzy implication rules. The form of the fuzzy rules comes with three types of fuzzy inferences: a simplified one that involves conclusions that are fixed numeric values, a linear one where the conclusion part is viewed as a linear function of inputs, and a regression polynomial one as the extended type of the linear one. By the nature of the rule-based fuzzy systems, these fuzzy models are geared toward capturing relationships between information granules. The form of the information granules themselves becomes an important design features of the fuzzy model. Information granulation with the aid of HCM(Hard C-Means) clustering algorithm hell)s determine the initial parameters of rule-based fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial function being used in the Premise and consequence Part of the fuzzy rules. And then the initial Parameters are tuned (adjusted) effectively with the aid of the improved complex method(ICM) and the standard least square method(LSM). In the sequel, the ICM and LSM lead to fine-tuning of the parameters of premise membership functions and consequent polynomial functions in the rules of fuzzy model. An aggregate objective function with a weighting factor is proposed in order to achieve a balance between performance of the fuzzy model. Numerical examples are included to evaluate the performance of the proposed model. They are also contrasted with the performance of the fuzzy models existing in the literature.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.433-436
• /
• 2004

In this paper, we introduce a new Fuzzy Polynomial Neural Networks (FPNNS)-like structure whose neuron is based on the Fuzzy Set-based Fuzzy Inference System (FS-FIS) and is different from that of FPNNS based on the Fuzzy relation-based Fuzzy Inference System (FR-FIS) and discuss the ability of the new FPNNS-like structure named Fuzzy Set-based Polynomial Neural Networks (FSPNN). The premise parts of their fuzzy rules are not identical, while the consequent parts of the both Networks (such as FPNN and FSPNN) are identical. This difference results from the angle of a viewpoint of partition of input space of system. In other word, from a point of view of FS-FIS, the input variables are mutually independent under input space of system, while from a viewpoint of FR-FIS they are related each other. The proposed design procedure for networks architecture involves the selection of appropriate nodes with specific local characteristics such as the number of input variables, the order of the polynomial that is constant, linear, quadratic, or modified quadratic functions being viewed as the consequent part of fuzzy rules, and a collection of the specific subset of input variables. On the parameter optimization phase, we adopt Information Granulation (IC) based on HCM clustering algorithm and a standard least square method-based learning. Through the consecutive process of such structural and parametric optimization, an optimized and flexible fuzzy neural network is generated in a dynamic fashion. To evaluate the performance of the genetically optimized FSPNN (gFSPNN), the model is experimented with using the time series dataset of gas furnace process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.236-244
• /
• 2005

In this study, we introduce a new topology of Fuzzy Polynomial Neural Networks(FPNN) that is based on fuzzy relation and evolutionally optimized Multi-Layer Perceptron, discuss a comprehensive design methodology and carry out a series of numeric experiments. The construction of the evolutionally optimized FPNN(EFPNN) exploits fundamental technologies of Computational Intelligence. The architecture of the resulting EFPNN results from a synergistic usage of the genetic optimization-driven hybrid system generated by combining rule-based Fuzzy Neural Networks(FNN) with polynomial neural networks(PNN). FNN contributes to the formation of the premise part of the overall rule-based structure of the EFPNN. The consequence part of the EFPNN is designed using PNN. As the consequence part of the EFPNN, the development of the genetically optimized PNN(gPNN) dwells on two general optimization mechanism: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the EFPNN, the models are experimented with the use of several representative numerical examples. A comparative analysis shows that the proposed EFPNN are models with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.639-647
• /
• 2011

In this paper, we introduce a design methodology of data-centroid Radial Basis Function neural networks with extended polynomial function. The two underlying design mechanisms of such networks involve K-means clustering method and Particle Swarm Optimization(PSO). The proposed algorithm is based on K-means clustering method for efficient processing of data and the optimization of model was carried out using PSO. In this paper, as the connection weight of RBF neural networks, we are able to use four types of polynomials such as simplified, linear, quadratic, and modified quadratic. Using K-means clustering, the center values of Gaussian function as activation function are selected. And the PSO-based RBF neural networks results in a structurally optimized structure and comes with a higher level of flexibility than the one encountered in the conventional RBF neural networks. The PSO-based design procedure being applied at each node of RBF neural networks leads to the selection of preferred parameters with specific local characteristics (such as the number of input variables, a specific set of input variables, and the distribution constant value in activation function) available within the RBF neural networks. To evaluate the performance of the proposed data-centroid RBF neural network with extended polynomial function, the model is experimented with using the nonlinear process data(2-Dimensional synthetic data and Mackey-Glass time series process data) and the Machine Learning dataset(NOx emission process data in gas turbine plant, Automobile Miles per Gallon(MPG) data, and Boston housing data). For the characteristic analysis of the given entire dataset with non-linearity as well as the efficient construction and evaluation of the dynamic network model, the partition of the given entire dataset distinguishes between two cases of Division I(training dataset and testing dataset) and Division II(training dataset, validation dataset, and testing dataset). A comparative analysis shows that the proposed RBF neural networks produces model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.9
• /
• pp.127-134
• /
• 2004

It is difficult to have the existing structural optimization using coupled field analysis from CFD to structure analysis when the structure is influenced of fluid. Therefore in an initial model of this study after doing parameter design from the background of shape using topology optimization. and it is making a approximation formula using by the CFD-structure coupled-field analysis and design of experiment. By using this result, we conducted multi-objective optimization. We could confirm efficiency of stochastic method applicable in the scene of structure reliability design to be needed multi-objective optimization. And we presented a way of design that could overcome the time and space restriction in structural design such as the butterfly valve with the less experiment.