Evaluation of crossover techniques in genetic algorithm based optimum structural design

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, 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 the common crossover techniques, and the results are fully discussed. (C) 2000 Civil-Comp Ltd. and Elsevier Science Ltd. All rights reserved.
COMPUTERS & STRUCTURES

Suggestions

Evaluation of crossover techniques in genetic algorithm based optimum structural design
Hasançebi, Oğuzhan (1998-08-21)
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 proce...
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...
Efficient and Accurate Electromagnetic Optimizations Based on Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2016-01-01)
We present electromagnetic optimizations by heuristic algorithms supported by approximate forms of the multilevel fast multipole algorithm (MLFMA). Optimizations of complex structures, such as antennas, are performed by considering each trial as an electromagnetic problem that can be analyzed via MLFMA and its approximate forms. A dynamic accuracy control is utilized in order to increase the efficiency of optimizations. Specifically, in the proposed scheme, the accuracy is used as a parameter of the optimiz...
Performance evaluation of metaheuristic search techniques in the optimum design of real size pin jointed structures
Hasançebi, Oğuzhan; Dogan, E.; Erdal, F.; Saka, M. P. (2009-03-01)
In recent years a number of metaheuristic search techniques have been widely used in developing structural optimization algorithms. Amongst these techniques are genetic algorithms, simulated annealing, evolution strategies, particle swarm optimizer, tabu search, ant colony optimization and harmony search. The primary goal of this paper is to objectively evaluate the performance of abovementioned seven techniques in optimum design of pin jointed structures. First, a verification of the algorithms used to imp...
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...
Citation Formats
O. Hasançebi, “Evaluation of crossover techniques in genetic algorithm based optimum structural design,” COMPUTERS & STRUCTURES, pp. 435–448, 2000, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36483.