Evaluation of crossover techniques in genetic algorithm based optimum structural design

Date

1998-08-21

Author

Hasançebi, Oğuzhan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

126
views

0
downloads

Crossover is one of the three basic operators in ally genetic algorithm (GA). Several crossover techniques have been proposed and their relative merits are currently under investigation. This paper starts with a brief discussion of the working scheme of genetic algorithms (GAs) and crossover techniques commonly used in previous GA applications. Next, these techniques are tested on two truss size optimization problems, and are evaluated with respect to exploration and exploitation aspects of the search process. Finally, the paper proposes two newly developed crossover techniques, through which a better efficiency of GAs can be obtained. Comparative studies are carried out between the proposed and common crossover techniques, and the results are fully discussed.

URI

https://hdl.handle.net/11511/52943

Conference Name

1st International Conference on Engineering Computational Technology/4th International Conference on Computational Structures Technology

Collections

Department of Civil Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Evaluation of crossover techniques in genetic algorithm based optimum structural design Hasançebi, Oğuzhan (2000-11-01) Crossover is one of the three basic operators in any genetic algorithm (GA). Several crossover techniques have been proposed and their relative merits are currently under investigation. This paper starts with a brief discussion of the working scheme of the GAs and the crossover techniques commonly used in previous GA applications. Next, these techniques are tested on two truss size optimization problems, and are evaluated with respect to exploration and exploitation aspects of the search process. Finally, t...
AUTOMATIC MULTI-SCALE SEGMENTATION OF HIGH SPATIAL RESOLUTION SATELLITE IMAGES USING WATERSHEDS Sahin, Kerem; Ulusoy, İlkay (2013-07-26) An automatic segmentation algorithm that is based on watersheds and region merging type multi-scale segmentation (MSS) is proposed, which can be used as the initial step of an object-based classifier. First, the image is segmented using watershed segmentation. Then, primitive segments are merged to create meaningful objects by the proposed hybrid region merging algorithm. During these steps, an unsupervised segmentation accuracy metric is considered so that best performing parameters of the proposed algorit...
ANALYSIS OF THE TRUNCATED SPIKE ALGORITHM MİKKELSEN, CCK; Manguoğlu, Murat (Society for Industrial & Applied Mathematics (SIAM), 2008-01-01) The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly diagonally dominant by rows. There are machines for which the current implementation of the algorithm is faster and scales better than the corresponding solver in ScaLAPACK (PDDBTRF/PDDBTRS). In this paper we prove that the SPIKE matrix is strictly diagonally dominant by rows with a degree no less than the original matrix. We establish tight upper bounds on the decay rate of the spikes as well as the truncati...
Development of a grid-aware master worker framework for artificial evolution Ketenci, Ahmet; Şener, Cevat; Department of Computer Engineering (2010) Genetic Algorithm (GA) has become a very popular tool for various kinds of problems, including optimization problems with wider search spaces. Grid search techniques are usually not feasible or ineffective at finding a solution, which is good enough. The most computationally intensive component of GA is the calculation of the goodness (fitness) of candidate solutions. However, since the fitness calculation of each individual does not depend each other, this process can be parallelized easily. The easiest wa...
A method for chromosome handling of r-permutations of n-element set in genetic algorithms Üçoluk, Göktürk (1997-04-16) Combinatorial optimisation problems are in the domain of Genetic Algorithms (GA) interest. Unfortunately ordinary crossover and mutation operators cause problems for chromosome representations of permutations and some types of combinations. This is so because offsprings generated by means of the ordinary operators are of a great possibility no more valid chromosomes. A variety of methods and new operators that handle that sort of obscenities are introduced throughout the literature. A new method for represe...

Citation Formats

O. Hasançebi, “Evaluation of crossover techniques in genetic algorithm based optimum structural design,” presented at the 1st International Conference on Engineering Computational Technology/4th International Conference on Computational Structures Technology, Edinburgh, Scotland, 1998, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52943.