A new optimization algorithm for solving complex constrained design optimization problems
This article presents the performance of a very recently proposed Jaya algorithm on a class of constrained design optimization problems. The distinct feature of this algorithm is that it does not have any algorithm-specific control parameters and hence the burden of tuning the control parameters is...
        Saved in:
      
    
          | Published in | Engineering optimization Vol. 49; no. 1; pp. 60 - 83 | 
|---|---|
| Main Authors | , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        Abingdon
          Taylor & Francis
    
        02.01.2017
     Taylor & Francis Ltd  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0305-215X 1029-0273  | 
| DOI | 10.1080/0305215X.2016.1164855 | 
Cover
| Summary: | This article presents the performance of a very recently proposed Jaya algorithm on a class of constrained design optimization problems. The distinct feature of this algorithm is that it does not have any algorithm-specific control parameters and hence the burden of tuning the control parameters is minimized. The performance of the proposed Jaya algorithm is tested on 21 benchmark problems related to constrained design optimization. In addition to the 21 benchmark problems, the performance of the algorithm is investigated on four constrained mechanical design problems, i.e. robot gripper, multiple disc clutch brake, hydrostatic thrust bearing and rolling element bearing. The computational results reveal that the Jaya algorithm is superior to or competitive with other optimization algorithms for the problems considered. | 
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23  | 
| ISSN: | 0305-215X 1029-0273  | 
| DOI: | 10.1080/0305215X.2016.1164855 |