Discrete parameter Nonlinear Constrained Optimization of a Gear Train by Genetic Algorithms

Date

2005-01-01

Author

Dölen, Melik
Seıreg, Alı

Metadata

Show full item record

Item Usage Stats

158
views

0
downloads

This paper investigates the optimal design of a four-stage gear train using genetic algorithms. Five different genetic encoding schemes, which incorporate various heuristic search techniques, are proposed to deal with the most critical constraints of the problem. The fitness criterion used by all genetic algorithms includes a merit function for minimising the size of the gearbox. The results show improvement in the design merit over previous approaches without reliance on the designer's interaction to avoid geometric constraint violations and facilitate the convergence.

Subject Keywords

Genetic algorithms, Discrete design optimisation, Penalty function, Integer programming, Multi stage gear design, Monlinear programming, Gear train optimisation, Optimal design, Gearbox size, Geometric constraints

URI

https://hdl.handle.net/11511/75501
https://www.inderscienceonline.com/doi/abs/10.1504/IJCAT.2005.007213

Journal

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY

Collections

Department of Mechanical Engineering, Article

Suggestions

OpenMETU
Core

Discrete size optimization of steel trusses using a refined big bang-big crunch algorithm Hasançebi, Oğuzhan (Informa UK Limited, 2014-01-02) This article presents a methodology that provides a method for design optimization of steel truss structures based on a refined big bang-big crunch (BB-BC) algorithm. It is shown that a standard formulation of the BB-BC algorithm occasionally falls short of producing acceptable solutions to problems from discrete size optimum design of steel trusses. A reformulation of the algorithm is proposed and implemented for design optimization of various discrete truss structures according to American Institute of St...
Multiobjective evolutionary feature subset selection algorithm for binary classification Deniz Kızılöz, Firdevsi Ayça; Coşar, Ahmet; Dökeroğlu, Tansel; Department of Computer Engineering (2016) This thesis investigates the performance of multiobjective feature subset selection (FSS) algorithms combined with the state-of-the-art machine learning techniques for binary classification problem. Recent studies try to improve the accuracy of classification by including all of the features in the dataset, neglecting to determine the best performing subset of features. However, for some problems, the number of features may reach thousands, which will cause too much computation power to be consumed during t...
Layout optimization of trusses using simulated annealing Hasançebi, Oğuzhan (2000-09-08) This paper addresses to the development of a simulated annealing (SA) based solution algorithm which is automated to achieve the simultaneous optimum design of truss type structures with respect to size, shape and topology design variables. The proposed algorithm is designed in such a way that together with applicability to practical design problems, it is also aimed at producing efficient and improved design solutions for the problems of interest. From the practicality point of view, the task is chosen as ...
Parametric Urban Design Thinking: Shared Patterns in Design by Algorithm and Design by Drawing Çalışkan, Olgu; Ongun, Gokhan (2021-12-01) The paper suggests a focused examination of the processes of drafting-based design and parametric design in urbanism. It discusses how spatial design's settled cognition would differ by using algorithmic systems through the altered relationships between the basic operations in design. To reveal the commonalities and distinctions between the two design methods, the authors present the detailed documentation of the workshop series, which experimented with both techniques within similar design contexts. By the...
An exponential big bang-big crunch algorithm for discrete design optimization of steel frames Hasançebi, Oğuzhan (2012-11-01) In the present study an enhanced variant of the big bang-big crunch (BB-BC) technique, namely exponential BB-BC algorithm (EBB-BC) is developed for code based design optimization of steel frame structures. It is shown that the standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete design optimization of steel frames. Hence, through investigating the shortcomings of BB-BC algorithm, it is aimed to reinforce the performance of the technique for th...

Citation Formats

M. Dölen and A. Seıreg, “Discrete parameter Nonlinear Constrained Optimization of a Gear Train by Genetic Algorithms,” INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, pp. 110–121, 2005, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/75501.