Search published articles


Showing 2 results for Penalty Functions

S. Shojaee, S. Hasheminasab,
Volume 1, Issue 2 (6-2011)
Abstract

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the convergence and robustness of a metaheuristic algorithm. Random initial sampling, Latin Hypercube Design, Sobol sequence, Hammersley and Halton sequences are employed for approximating initial design. Comparative studies demonstrate that well distributed initial sampling speeds up the convergence to near optimal design and reduce the required computational cost of purely random sampling methodologies. In addition different penalty functions that define the Augmented Lagrangian methods considered in this paper to improve the algorithms. Some examples presented to show these applications.
S. Gholizadeh, A. Barzegar , Ch. Gheyratmand,
Volume 1, Issue 3 (9-2011)
Abstract

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.

Page 1 from 1     

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

Designed & Developed by : Yektaweb