• 제목/요약/키워드: Constraint Handling Technique

검색결과 11건 처리시간 0.023초

제약조건 처리기법에 따른 하모니써치 알고리즘의 효율성 평가 : 관로 최소비용설계 문제의 적용 (Efficiency Evaluation of Harmony Search Algorithm according to Constraint Handling Techniques : Application to Optimal Pipe Size Design Problem)

  • 유도근;이호민;이의훈;김중훈
    • 한국산학기술학회논문지
    • /
    • 제16권7호
    • /
    • pp.4999-5008
    • /
    • 2015
  • 제약조건이 있는 공학 최적화 문제에서 보다 좋은 결과를 얻기 위해서는 효율적인 제약조건 처리기법의 적용은 필수적이다. 본 연구에서는 네 가지의 제약조건 처리기법을 적용하여 메타휴리스틱 최적화 기법으로 널리 사용되고 있는 Harmony Search 알고리즘의 최적화 효율성을 평가하였다. 평가를 위해 대표적인 이산형 최적화 문제 중 하나인 상수관로 최소비용설계 문제를 적용하였다. 적용결과 전통적인 제약조건 처리방법으로 사용되던 벌칙함수에 비해 제안된 제약조건 처리기법의 결과가 효율적임을 확인하였다. 특히, ${\varepsilon}$-Constrained Method의 경우 기존방법에 비하여 효율적이고 안정적인 결과를 도출하였다. 제안된 방법은 새로운 최적화 알고리즘의 개발 필요 없이 HS의 성능을 증가시킬 수 있다는 점에서 의의가 있다고 판단된다. 또한 400개 이상의 결정변수를 가지는 대규모 문제의 적용을 통하여, 제안된 방법이 대규모 공학 최적화 문제에서도 활용이 가능함을 확인하였다.

보 보강재 배치 최적화 문제에서의 기하구속조건 처리기법 (A Geometry Constraint Handling Technique in Beam Stiffener Layout Optimization Problem)

  • 이준호;박영진;박윤식
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2004년도 춘계학술대회논문집
    • /
    • pp.870-875
    • /
    • 2004
  • Beam stiffeners have frequently been used for raising natural frequencies of base structures. In stiffener layout optimization problems, most of the previous researches considering the position and/or the length of the stiffener as design variables dealt with structures having just simple convex shapes such as a square or rectangle. The reason is concave shape structures have difficulties ill formulating geometry constraints. In this paper, a new geometry constraint handling technique, which can define both convex and concave feasible lesions and measure a degree of geometry constraint violation, is proposed. Evolution strategies (ESs) is utilized as an optimization tool. In addition, the constraint-handling technique of EVOSLINOC (EVOlution Strategy for scalar optimization with Lineal and Nonlinear Constraints) is utilized to solve constrained optimization problems. From a numerical example, the proposed geometry constraint handling technique is verified and proves that the technique can easily be applied to structures in net only convex but also concave shapes, even with a protrusion or interior holes.

  • PDF

Synthesis of four-bar linkage motion generation using optimization algorithms

  • Phukaokaew, Wisanu;Sleesongsom, Suwin;Panagant, Natee;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제4권3호
    • /
    • pp.197-210
    • /
    • 2019
  • Motion generation of a four-bar linkage is a type of mechanism synthesis that has a wide range of applications such as a pick-and-place operation in manufacturing. In this research, the use of meta-heuristics for motion generation of a four-bar linkage is demonstrated. Three problems of motion generation were posed as a constrained optimization probably using the weighted sum technique to handle two types of tracking errors. A simple penalty function technique was used to deal with design constraints while three meta-heuristics including differential evolution (DE), self-adaptive differential evolution (JADE) and teaching learning based optimization (TLBO) were employed to solve the problems. Comparative results and the effect of the constraint handling technique are illustrated and discussed.

Adaptive Truncation technique for Constrained Multi-Objective Optimization

  • Zhang, Lei;Bi, Xiaojun;Wang, Yanjiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권11호
    • /
    • pp.5489-5511
    • /
    • 2019
  • The performance of evolutionary algorithms can be seriously weakened when constraints limit the feasible region of the search space. In this paper we present a constrained multi-objective optimization algorithm based on adaptive ε-truncation (ε-T-CMOA) to further improve distribution and convergence of the obtained solutions. First of all, as a novel constraint handling technique, ε-truncation technique keeps an effective balance between feasible solutions and infeasible solutions by permitting some excellent infeasible solutions with good objective value and low constraint violation to take part in the evolution, so diversity is improved, and convergence is also coordinated. Next, an exponential variation is introduced after differential mutation and crossover to boost the local exploitation ability. At last, the improved crowding density method only selects some Pareto solutions and near solutions to join in calculation, thus it can evaluate the distribution more accurately. The comparative results with other state-of-the-art algorithms show that ε-T-CMOA is more diverse than the other algorithms and it gains better in terms of convergence in some extent.

구속조건의 효율적인 처리를 위한 유전자 알고리즘의 개발 (Development of Genetic Algorithms for Efficient Constraints Handling)

  • 조영석;최동훈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집A
    • /
    • pp.725-730
    • /
    • 2000
  • Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

  • PDF

종축 비행성 요구도 및 안정성 여유 만족을 위한 비행제어법칙 최적화 및 평가 (Optimization and Evaluation of Flight Control Laws to Satisfy Longitudinal Handling Quality and Stability Margin Requirements)

  • 김성현;고득원;이태현;김동환;김병수
    • 항공우주시스템공학회지
    • /
    • 제15권5호
    • /
    • pp.8-15
    • /
    • 2021
  • 본 논문은 고기동 제트항공기의 종축 비행성 요구도를 만족하기 위해 최적화 기법을 이용한 설계 방법에 관해 기술한다. 대상 항공기는 모델 역변환 기법이 적용되었으며, 제어이득 최적화로 종축 단주기 비행성 요구도를 만족하지만, 안정성 여유 항목이 고려되지 않았다. 안정성 여유를 만족하지 못하는 경우 개선을 위해 시행 착오법 등을 통한 이득의 직접 재조정이 필요하며, 이를 개선하기 위해 추가적인 보상기와 최적화 구속조건을 추가한 제어이득 최적화 방안을 제시하였다. 또한, 최적화 결과에 대한 비행성 만족도를 재평가하였으며, 최적화 구속조건으로 설정된 비행성 요구도가 반영하지 못하는 시간 반응의 수렴성과 정상상태 오차에 대한 추가적인 제어법칙 평가 기준 설정 및 그 결과에 관해 기술한다.

객체지향기법을 이용한 플레이트 거더교의 동해석 (Dynamic Analysis of Plate Girder Bridge Using Object-Oriented Technique)

  • 조정래;곽종원;진원종;최은석;강재윤;이정우
    • 한국콘크리트학회:학술대회논문집
    • /
    • 한국콘크리트학회 2006년도 춘계학술발표회 논문집(I)
    • /
    • pp.486-489
    • /
    • 2006
  • This paper presents a newly proposed object-oriented finite element framework and its applications on dynamic analysis of plate girder bridge. The developed framework supports various types of finite elements, materials, constraints, loads, and solution methods. One major feature different from other object-oriented finite element programs is that static model and dynamic state can be easily read from or written to a file. In addition, the framework supports efficient DOF pattern handling for a node connecting elements with different DOF patterns, new multi-point constraint handling, and various scripting languages for easy use of the library. In order to show the applicability to dynamic analysis, dynamic moving load analysis on plate girder bridge is performed.

  • PDF

A Multi-Objective Genetic Algorithm Approach to the Design of Reliable Water Distribution Networks

  • T.Devi Prasad;Park, Nam-Sik
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2002년도 학술발표회 논문집(II)
    • /
    • pp.829-836
    • /
    • 2002
  • The paper presents a multi-objective genetic algorithm approach to the design of a water distribution network. The objectives considered are minimization of network cost and maximization of a reliability measure. In this study, a new reliability measure, called network resilience, is introduced. This measure mimics a designer's desire of providing excess power at nodes and designing reliable loops with practicable pipe diameters. The proposed method produces a set of Pareto-optimal solutions in the search space of cost and network resilience. Genetic algorithms are observed to be poor in handling constraints. To handle constraints in a better way, a constraint handling technique that does not require a penalty coefficient and applicable to water distribution systems is presented. The present model is applied to two example problems, which were widely reported. Pipe failure analysis carried out on some of the solutions obtained revealed that the network resilience based approach gave better results in terms of network reliability.

  • PDF

An integrated particle swarm optimizer for optimization of truss structures with discrete variables

  • Mortazavi, Ali;Togan, Vedat;Nuhoglu, Ayhan
    • Structural Engineering and Mechanics
    • /
    • 제61권3호
    • /
    • pp.359-370
    • /
    • 2017
  • This study presents a particle swarm optimization algorithm integrated with weighted particle concept and improved fly-back technique. The rationale behind this integration is to utilize the affirmative properties of these new terms to improve the search capability of the standard particle swarm optimizer. Improved fly-back technique introduced in this study can be a proper alternative for widely used penalty functions to handle existing constraints. This technique emphasizes the role of the weighted particle on escaping from trapping into local optimum(s) by utilizing a recursive procedure. On the other hand, it guaranties the feasibility of the final solution by rejecting infeasible solutions throughout the optimization process. Additionally, in contrast with penalty method, the improved fly-back technique does not contain any adjustable terms, thus it does not inflict any extra ad hoc parameters to the main optimizer algorithm. The improved fly-back approach, as independent unit, can easily be integrated with other optimizers to handle the constraints. Consequently, to evaluate the performance of the proposed method on solving the truss weight minimization problems with discrete variables, several benchmark examples taken from the technical literature are examined using the presented method. The results obtained are comparatively reported through proper graphs and tables. Based on the results acquired in this study, it can be stated that the proposed method (integrated particle swarm optimizer, iPSO) is competitive with other metaheuristic algorithms in solving this class of truss optimization problems.

DIntrusion Detection in WSN with an Improved NSA Based on the DE-CMOP

  • Guo, Weipeng;Chen, Yonghong;Cai, Yiqiao;Wang, Tian;Tian, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5574-5591
    • /
    • 2017
  • Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.