• 제목/요약/키워드: polynomial optimization

검색결과 354건 처리시간 0.018초

병렬처리리례 상에서 동작업완료시간의 최소화해법에 관한 연구 (A Study on Approximate and Exact Algorithms to Minimize Makespan on Parallel Processors)

  • 안상형;이송근
    • 한국경영과학회지
    • /
    • 제16권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.

  • PDF

Information Granulation-based Fuzzy Inference Systems by Means of Genetic Optimization and Polynomial Fuzzy Inference Method

  • Park Keon-Jun;Lee Young-Il;Oh Sung-Kwun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권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.

Empirical process optimization through response surface experiments and model building

  • PARK, SUNG H.
    • 품질경영학회지
    • /
    • 제8권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.

  • PDF

효과적인 배낭 문제 해결을 위해 DNA 코딩 방법을 적용한 DNA 컴퓨팅 (DNA Computing Adopting DNA coding Method to solve effective Knapsack Problem)

  • 김은경;이상용
    • 한국지능시스템학회논문지
    • /
    • 제15권6호
    • /
    • pp.730-735
    • /
    • 2005
  • 배낭 문제는 단순한 것 같지만 조합 최적화 문제로서, 다항 시간(polynomial time)에 풀리지 않는 NP-hard 문제이다. 이 문제를 해결하기 위해 기존에는 GA(Genetic Algorithms)를 이용하여 해결하였다. 하지만 기존의 방법은 DNA의 정확한 특성을 고려하지 않아, 실제 실험과의 결과 차이가 발생하고 있다. 본 논문에서는 배낭 문제의 문제점을 해결하기 위해 DNA 컴퓨팅 기법에 DNA 코딩 방법을 적용한 ACO(Algorithm for Code Optimization)를 제안한다. ACO는 배낭 문제 중 (0,1)-배낭 문제에 적용하였고, 그 결과 기존의 방법보다 실험적 오류를 최소화하였으며, 또한 적합한 해를 빠른 시간내에 찾을 수 있었다.

분류시스템을 이용한 다항식기반 반응표면 근사화 모델링 (Development of Polynomial Based Response Surface Approximations Using Classifier Systems)

  • 이종수
    • 한국CDE학회논문집
    • /
    • 제5권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.

  • PDF

데이터 정보입자 기반 퍼지 추론 시스템의 최적화 (Optimization of Fuzzy Inference Systems Based on Data Information Granulation)

  • 오성권;박건준;이동윤
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권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.

Evolutionary Data Granulation 기반으로한 퍼지 집합 다항식 뉴럴 네트워크에 관한 연구 (A Study on Fuzzy Set-based Polynomial Neural Networks Based on Evolutionary Data Granulation)

  • 노석범;안태천;오성권
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2004년도 추계학술대회 학술발표 논문집 제14권 제2호
    • /
    • 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.

  • PDF

퍼지관계와 유전자 알고리즘에 기반한 진화론적 최적 퍼지다항식 뉴럴네트워크: 해석과 설계 (Evolutionally optimized Fuzzy Polynomial Neural Networks Based on Fuzzy Relation and Genetic Algorithms: Analysis and Design)

  • 박병준;이동윤;오성권
    • 한국지능시스템학회논문지
    • /
    • 제15권2호
    • /
    • pp.236-244
    • /
    • 2005
  • 본 연구에서는 퍼지관계 및 진화론적 최적 다층 퍼셉트론에 기초한 퍼지다항식 뉴럴네트워크(FPNN)의 새로운 구조를 소개하고, 포괄적인 설계방법론을 토의하며, 그리고 일련의 수치적인 실험이 수행된다. 진화론적 최적 FPNN(EFPNN)의 구축을 위해 컴퓨터지능(CI)의 기반 기술을 이용한다. EFPNN의 구조는 규칙베이스 퍼지뉴럴네트워크와 다항식 뉴럴네트워크의 결합에 의한 유전자 최적 구동 하이브리드 시스템의 시너지 이용으로 얻어진다. 퍼지뉴럴네트워크는 EFPNN의 전체규칙 구조의 전반부에 기여하고, EFPNN의 후반부는 다항식 뉴럴네트워크를 사용하여 설계된다. EFPNN의 후반부를 위한 유전론적 최적 다항식 뉴럴네트워크의 개발은 두 최적화 기법에 의해 수행된다. 즉 구조적 최적화는 유전자알고리즘에 의해 수행되고, 파라미터 최적화는 최소자승법 기반의 학습을 통해 행하여진다. EFPNN의 성능 평가를 위해, 모델은 몇 가지 수치 예제를 이용한다. 비교에 의한 해석은 제안된 EFPNN이 이전에 제시된 다른 지능형 모델보다 높은 정확도 뿐만 아니라 좀 더 우수한 예측능력을 가지는 모델임을 보여준다.

데이터 중심 다항식 확장형 RBF 신경회로망의 설계 및 최적화 (Design of Data-centroid Radial Basis Function Neural Network with Extended Polynomial Type and Its Optimization)

  • 오성권;김영훈;박호성;김정태
    • 전기학회논문지
    • /
    • 제60권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.

연성해석과 통계적 방법을 이용한 Butterfly Valve의 다목적 최적설계 (Multi-objective Optimization of Butterfly Valve using the Coupled-Field Analysis and the Statistical Method)

  • 배인환;이동화;박영철
    • 한국정밀공학회지
    • /
    • 제21권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.