• Title/Summary/Keyword: Meta-heuristic algorithm

Search Result 170, Processing Time 0.03 seconds

Optimal design of double layer barrel vaults considering nonlinear behavior

  • Gholizadeh, Saeed;Gheyratmand, Changiz;Davoudi, Hamed
    • Structural Engineering and Mechanics
    • /
    • v.58 no.6
    • /
    • pp.1109-1126
    • /
    • 2016
  • The present paper focuses on size optimization of double layer barrel vaults considering nonlinear behavior. In order to tackle the optimization problem an improved colliding bodies optimization (ICBO) algorithm is proposed. The important task that should be achieved before optimization of structural systems is to determine the best form having the least cost. In this study, an attempt is done to find the best form then it is optimized considering linear and non-linear behaviors. In the optimization process based on nonlinear behavior, the geometrical and material nonlinearity effects are included. A large-scale double layer barrel vault is presented as the numerical example of this study and the obtained results indicate that the proposed ICBO has better computational performance compared with other algorithms.

Scheduling of Production Process with Setup Cost depending Job Sequence (작업순서에 따라 달라지는 준비 비용을 갖는 PCB 생산 공정의 일정계획)

  • Yu, Sungyeol
    • Management & Information Systems Review
    • /
    • v.34 no.2
    • /
    • pp.67-78
    • /
    • 2015
  • In this paper, we consider a scheduling problem of printed circuit board production process with setup cost depending job sequence. Given a set of PCBs, these are produced in single surface mounting device. The problem is to define job sequence with the objective of minimizing the total seutp cost. We propose a mathematical formulation and the problem is proven to be NP-hard. So, a meta heuristic based on genetic algorithm is developed.

  • PDF

Tabu Search based Optimization Algorithm for Reporting Cell Planning in Mobile Communication (이동통신에서 리포팅 셀 계획을 위한 타부서치 기반 최적화 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1193-1201
    • /
    • 2020
  • Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

Ontology Alignment by Using Discrete Cuckoo Search (이산 Cuckoo Search를 이용한 온톨로지 정렬)

  • Han, Jun;Jung, Hyunjun;Baik, Doo-Kwon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.12
    • /
    • pp.523-530
    • /
    • 2014
  • Ontology alignment is the way to share and reuse of ontology knowledge. Because of the ambiguity of concept, most ontology alignment systems combine a set of various measures and complete enumeration to provide the satisfactory result. However, calculating process becomes more complex and required time increases exponentially since the number of concept increases, more errors can appear at the same time. Lately the focus is on meta-matching using the heuristic algorithm. Existing meta-matching system tune extra parameter and it causes complex calculating, as a consequence, the results in the various data of specific domain are not good performed. In this paper, we propose a high performance algorithm by using DCS that can solve ontology alignment through simple process. It provides an efficient search strategy according to distribution of Levy Flight. In order to evaluate the approach, benchmark data from the OAEI 2012 is employed. Through the comparison of the quality of the alignments which uses DCS with state of the art ontology matching systems.

An optimal feature selection algorithm for the network intrusion detection system (네트워크 침입 탐지를 위한 최적 특징 선택 알고리즘)

  • Jung, Seung-Hyun;Moon, Jun-Geol;Kang, Seung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.342-345
    • /
    • 2014
  • Network intrusion detection system based on machine learning methods is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features from generally used features to detect network intrusion requires extensive computing resources. For instance, the number of possible feature combinations from given n features is $2^n-1$. In this paper, to tackle this problem we propose a optimal feature selection algorithm. Proposed algorithm is based on the local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In addition, the accuracy of clusters which obtained using selected feature components and k-means clustering algorithm is adopted to evaluate a feature assembly. In order to estimate the performance of our proposed algorithm, comparing with a method where all features are used on NSL-KDD data set and multi-layer perceptron.

  • PDF

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

  • Kheshti, Mostafa;Kang, Xiaoning;Jiao, Zaibin
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.612-620
    • /
    • 2017
  • Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

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

  • Khatibinia, Mohsen;Mohammadizadeh, Mohammad Reza
    • Structural Engineering and Mechanics
    • /
    • v.61 no.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.

Health monitoring of pressurized pipelines by finite element method using meta-heuristic algorithms along with error sensitivity assessment

  • Amirmohammad Jahan;Mahdi Mollazadeh;Abolfazl Akbarpour;Mohsen Khatibinia
    • Structural Engineering and Mechanics
    • /
    • v.87 no.3
    • /
    • pp.211-219
    • /
    • 2023
  • The structural health of a pipeline is usually assessed by visual inspection. In addition to the fact that this method is expensive and time consuming, inspection of the whole structure is not possible due to limited access to some points. Therefore, adopting a damage detection method without the mentioned limitations is important in order to increase the safety of the structure. In recent years, vibration-based methods have been used to detect damage. These methods detect structural defects based on the fact that the dynamic responses of the structure will change due to damage existence. Therefore, the location and extent of damage, before and after the damage, are determined. In this study, fuzzy genetic algorithm has been used to monitor the structural health of the pipeline to create a fuzzy automated system and all kinds of possible failure scenarios that can occur for the structure. For this purpose, the results of an experimental model have been used. Its numerical model is generated in ABAQUS software and the results of the analysis are used in the fuzzy genetic algorithm. Results show that the system is more accurate in detecting high-intensity damages, and the use of higher frequency modes helps to increase accuracy. Moreover, the system considers the damage in symmetric regions with the same degree of membership. To deal with the uncertainties, some error values are added, which are observed to be negligible up to 10% of the error.

A TSK fuzzy model optimization with meta-heuristic algorithms for seismic response prediction of nonlinear steel moment-resisting frames

  • Ebrahim Asadi;Reza Goli Ejlali;Seyyed Arash Mousavi Ghasemi;Siamak Talatahari
    • Structural Engineering and Mechanics
    • /
    • v.90 no.2
    • /
    • pp.189-208
    • /
    • 2024
  • Artificial intelligence is one of the efficient methods that can be developed to simulate nonlinear behavior and predict the response of building structures. In this regard, an adaptive method based on optimization algorithms is used to train the TSK model of the fuzzy inference system to estimate the seismic behavior of building structures based on analytical data. The optimization algorithm is implemented to determine the parameters of the TSK model based on the minimization of prediction error for the training data set. The adaptive training is designed on the feedback of the results of previous time steps, in which three training cases of 2, 5, and 10 previous time steps were used. The training data is collected from the results of nonlinear time history analysis under 100 ground motion records with different seismic properties. Also, 10 records were used to test the inference system. The performance of the proposed inference system is evaluated on two 3 and 20-story models of nonlinear steel moment frame. The results show that the inference system of the TSK model by combining the optimization method is an efficient computational method for predicting the response of nonlinear structures. Meanwhile, the multi-vers optimization (MVO) algorithm is more accurate in determining the optimal parameters of the TSK model. Also, the accuracy of the results increases significantly with increasing the number of previous steps.