• 제목/요약/키워드: meta-heuristic

검색결과 215건 처리시간 0.025초

Topology, shape, and size optimization of truss structures using modified teaching-learning based optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제2권4호
    • /
    • pp.313-331
    • /
    • 2017
  • In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

Intelligent fuzzy inference system approach for modeling of debonding strength in FRP retrofitted masonry elements

  • Khatibinia, Mohsen;Mohammadizadeh, Mohammad Reza
    • Structural Engineering and Mechanics
    • /
    • 제61권2호
    • /
    • pp.283-293
    • /
    • 2017
  • The main contribution of the present paper is to propose an intelligent fuzzy inference system approach for modeling the debonding strength of masonry elements retrofitted with Fiber Reinforced Polymer (FRP). To achieve this, the hybrid of meta-heuristic optimization methods and adaptive-network-based fuzzy inference system (ANFIS) is implemented. In this study, particle swarm optimization with passive congregation (PSOPC) and real coded genetic algorithm (RCGA) are used to determine the best parameters of ANFIS from which better bond strength models in terms of modeling accuracy can be generated. To evaluate the accuracy of the proposed PSOPC-ANFIS and RCGA-ANFIS approaches, the numerical results are compared based on a database from laboratory testing results of 109 sub-assemblages. The statistical evaluation results demonstrate that PSOPC-ANFIS in comparison with ANFIS-RCGA considerably enhances the accuracy of the ANFIS approach. Furthermore, the comparison between the proposed approaches and other soft computing methods indicate that the approaches can effectively predict the debonding strength and that their modeling results outperform those based on the other methods.

Optimal design of pitched roof frames with tapered members using ECBO algorithm

  • Kaveh, Ali;Mahdavi, Vahid Reza;Kamalinejad, Mohammad
    • Smart Structures and Systems
    • /
    • 제19권6호
    • /
    • pp.643-652
    • /
    • 2017
  • Pitched roof frames are widely used in construction of the industrial buildings, gyms, schools and colleges, fire stations, storages, hangars and many other low rise structures. The weight and shape of the gable frames with tapered members, as a familiar group of the pitched roof frames, are highly dependent on the properties of the member cross-sectional. In this work Enhanced Colliding Bodies Optimization (ECBO) is utilized for optimal design of three gable frames with tapered members. In order to optimize the frames, the design is performed using the AISC specifications for stress, displacement and stability constraints. The design constraints and weight of the gable frames are computed from the cross-section of members. These optimum weights are obtained using aforementioned optimization algorithms considering the cross-sections of the members and design constraints as optimization variables and constraints, respectively. A comparative study of the PSO and CBO with ECBO is also performed to illustrate the importance of the enhancement of the utilized optimization algorithm.

교차점과 오차행렬을 이용한 사람 검출용 퍼지 분류기 진화 설계 (Evolutionary Design of Fuzzy Classifiers for Human Detection Using Intersection Points and Confusion Matrix)

  • 이준용;박소연;최병석;신승용;이주장
    • 제어로봇시스템학회논문지
    • /
    • 제16권8호
    • /
    • pp.761-765
    • /
    • 2010
  • This paper presents the design of optimal fuzzy classifier for human detection by using genetic algorithms, one of the best-known meta-heuristic search methods. For this purpose, encoding scheme to search the optimal sequential intersection points between adjacent fuzzy membership functions is originally presented for the fuzzy classifier design for HOG (Histograms of Oriented Gradient) descriptors. The intersection points are sequentially encoded in the proposed encoding scheme to reduce the redundancy of search space occurred in the combinational problem. Furthermore, the fitness function is modified with the true-positive and true-negative of the confusion matrix instead of the total success rate. Experimental results show that the two proposed approaches give superior performance in HOG datasets.

무선 센서 네트워크에서 최대 수명 데이터 수집 문제를 위한 시뮬레이티드 어닐링 알고리즘 (A Simulated Annealing Algorithm for Maximum Lifetime Data Aggregation Problem in Wireless Sensor Networks)

  • 장길웅
    • 한국정보통신학회논문지
    • /
    • 제17권7호
    • /
    • pp.1715-1724
    • /
    • 2013
  • 무선 센서 네트워크에서 최대 수명 데이터 수집 문제는 네트워크에 배치된 모든 노드의 데이터 전송 에너지를 최소화함으로써 네트워크의 수명을 최대화하는 문제이다. 본 논문은 무선 센서 네트워크에서 최대 수명 데이터 수집문제를 효과적으로 해결하기 위한 메타휴리스틱 기법 중 하나인 시뮬레이티드 어닐링 알고리즘을 제안한다. 제안된 알고리즘에서는 보다 효과적인 해를 찾기 위해 새로운 이웃해 생성방식과 복구함수를 적용한다. 제안된 알고리즘의 성능은 네트워크 수명과 알고리즘 실행시간 관점에서 기존의 알고리즘과 비교평가 하였으며, 실험 결과에서 제안된 알고리즘이 최대 수명 데이터 수집 문제에 효과적으로 적용됨을 보여준다.

실내 환경에서 위치 인식율을 고려한 AP 배치 기법의 모델링 및 성능 평가 (Modeling and Performance Evaluation of AP Deployment Schemes for Indoor Location-Awareness)

  • 김태훈;탁성우
    • 한국정보통신학회논문지
    • /
    • 제17권4호
    • /
    • pp.847-856
    • /
    • 2013
  • 본 논문에서는 실내 환경에서 위치 인식을 고려한 AP 배치 기법을 제안하고 성능평가를 수행하였다. 제안한 기법은 위치 인식율과 AP 기반 무선 네트워크의 성능 및 비용을 고려하여 근사 최적 AP 구성 형태를 생성하는 메타휴리스틱 알고리즘과 AP 배치 과정을 빠르게 수렴하게 하는 결정론적 알고리즘으로 구성된다. 실내 공간과 유사한 시뮬레이션 환경을 구축하여 제안한 AP 배치 기법의 성능 평가를 수행하였으며, 제안한 기법은 빠른 시간 내에 우수한 결과를 생성하였다.

화음탐색 알고리즘을 이용한 네트워크 돔의 정삼각형 격자 조절기법 (An Arrangement Technique for Fine Regular Triangle Grid of Network Dome by Using Harmony Search Algorithm)

  • 손수덕;조혜원;이승재
    • 한국공간구조학회논문집
    • /
    • 제15권2호
    • /
    • pp.87-94
    • /
    • 2015
  • This paper aimed at modeling a fine triangular grid for network dome by using Harmony Search (HS) algorithm. For this purpose, an optimization process to find a fine regular triangular mesh on the curved surface was proposed and the analysis program was developed. An objective function was consist of areas and edge's length of each triangular and its standard deviations, and design variables were subject to the upper and lower boundary which was calculated on the nodal connectivity. Triangular network dome model, which was initially consist of randomly irregular triangular mesh, was selected for the target example and the numerical result was analyzed in accordance with the HS parameters. From the analysis results of adopted model, the fitness function has been converged and the optimized triangular grid could be obtained from the initially distorted network dome example.

5G 이동통신 셀 설계를 위한 타부 탐색과 유전 알고리즘의 성능 (Performance comparison of Tabu search and genetic algorithm for cell planning of 5G cellular network)

  • 권오현;안흥섭;최승원
    • 디지털산업정보학회논문지
    • /
    • 제13권3호
    • /
    • pp.65-73
    • /
    • 2017
  • The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법 (A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System)

  • 김기태;전건욱
    • 산업경영시스템학회지
    • /
    • 제33권2호
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

A Load-Balancing Approach Using an Improved Simulated Annealing Algorithm

  • Hanine, Mohamed;Benlahmar, El-Habib
    • Journal of Information Processing Systems
    • /
    • 제16권1호
    • /
    • pp.132-144
    • /
    • 2020
  • Cloud computing is an emerging technology based on the concept of enabling data access from anywhere, at any time, from any platform. The exponential growth of cloud users has resulted in the emergence of multiple issues, such as the workload imbalance between the virtual machines (VMs) of data centers in a cloud environment greatly impacting its overall performance. Our axis of research is the load balancing of a data center's VMs. It aims at reducing the degree of a load's imbalance between those VMs so that a better resource utilization will be provided, thus ensuring a greater quality of service. Our article focuses on two phases to balance the workload between the VMs. The first step will be the determination of the threshold of each VM before it can be considered overloaded. The second step will be a task allocation to the VMs by relying on an improved and faster version of the meta-heuristic "simulated annealing (SA)". We mainly focused on the acceptance probability of the SA, as, by modifying the content of the acceptance probability, we could ensure that the SA was able to offer a smart task distribution between the VMs in fewer loops than a classical usage of the SA.