Search published articles

Showing 6 results for Harmony Search Algorithm

K.s. Lee, S.w. Han, Z.w. Geem,
Volume 1, Issue 1 (3-2011)

Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discrete sizing variables and integrated discrete sizing and continuous geometric variables. The HS algorithm uses a stochastic random search instead of a gradient search so the former has a new-paradigmed derivative. Several truss examples from the literature are also presented to demonstrate the effectiveness and robustness of the new method, as compared to current optimization methods.
S. Gholizadeh, A. Barzegar , Ch. Gheyratmand,
Volume 1, Issue 3 (9-2011)

The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In fact the MHS is a multi-staged version of the HS and in each stage a new harmony memory is created using the information of the previous stages. Numerical results reveal that the proposed algorithm is a powerful optimization technique with improved exploitation characteristics compared with the standard HS.
S. Carbas, M.p. Saka,
Volume 3, Issue 1 (3-2013)

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficulties encountered in obtaining the solution of these problems, new techniques called metaheuristic algorithms are suggested. These techniques are numerical optimization algorithms that are based on a natural phenomenon. In this study, a state-of-art improved harmony search method with a new adaptive error strategy is proposed to handle the design constraints. Number of numerical examples is presented to demonstrate the efficiency of the proposed algorithm in solving engineering optimization problems.
S. Danka,
Volume 3, Issue 4 (10-2013)

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cost-oriented point of view. In the presented approach, it is assumed that each activity-duration and each cash flow value is an uncertain-but-bounded parameter, which is characterized by its optimistic and pessimistic estimations. The evaluation of a given robust schedule is based on the investigation of variability of the makespan as a primary and the net present value (NPV) as secondary criterion on the set of randomly generated scenarios given by a sampling-on-sampling-like process. Theoretically, the robust schedule-searching algorithm is formulated as a mixed integer linear programming problem, which is combined with a cost-oriented sampling-based approximation phase. In order to illustrate the essence of the proposed approach we present detailed computational results for a larger and very challenging project instance. A problem specific fast and efficient harmony search algorithm for large uncertain problems will be presented in a forthcoming paper.
H. Fattahi,
Volume 5, Issue 1 (1-2015)

The slope stability analysis is routinely performed by engineers to estimate the stability of river training works, road embankments, embankment dams, excavations and retaining walls. This paper presents a new approach to build a model for the prediction of slope stability state. The support vector machine (SVM) is a new machine learning method based on statistical learning theory, which can solve the classification problem with small sampling, non-linearity and high dimension. However, the practicability of the SVM is influenced by the difficulty of selecting appropriate SVM parameters. In this study, the proposed hybrid harmony search (HS) with SVM was applied for the prediction of slope stability state, in which HS was used to determine the optimized free parameters of the SVM. A dataset that includes 55 data points was applied in current study, while 45 data points (80%) were used for constructing the model and the remainder data points (10 data points) were used for assessment of degree of accuracy and robustness. The results obtained indicate that the SVM-HS model can be used successfully for the prediction of slope stability state for circular failure.
S. Dehghani Fordoei, S.a. Razavian Amrei, M. Eghbali, M. Sh. Nasrollah Beigi,
Volume 8, Issue 4 (10-2018)

Vulnerability assessment of structures encounter many uncertainties like seismic excitations intensity and response of structures. The most common approach adopted to deal with these uncertainties is vulnerability assessment through fragility functions. Fragility functions exhibit the probability of exceeding a state namely performance-level as a function of seismic intensity. A common approach is finding some response points of the fragility function and then fitting a typical probability distribution like lognormal through curve fitting estimation techniques. Maximum-likelihood approach is a fitting method to find the probability distribution parameters. Performing this approach for distributions like lognormal which is defined by just two parameters are straight forward while for more complicated distribution which are based on additional characterizing parameters is not feasible, since this approach is based on minimizing an error function through classic mathematical approaches like calculating partial derivations. An applicable modification is to add an efficient optimization approach to determine maximum-likelihood function. In this article, an optimization algorithm is proposed with maximum-likelihood-estimation and the results indicate the efficiency and feasibility of future developments in finding the most appropriate fragility function.

Page 1 from 1     

© 2020 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb