Skip navigation


Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2659
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRao, R. V.-
dc.contributor.authorWaghmare, G. G.-
dc.date.accessioned2020-02-04T04:56:08Z-
dc.date.available2020-02-04T04:56:08Z-
dc.date.issued2014-12-27-
dc.identifier.urihttp://192.168.3.232:8080/jspui/handle/123456789/2659-
dc.description.abstractMulti-objective optimization is the process of simultaneously optimizing two or more conflicting objectives subject to certain constraints. Real-life engineering designs often contain more than one conflicting objective function, which requires a multi-objective approach. In a single-objective optimization problem, the optimal solution is clearly defined, while a set of trade-offs that gives rise to numerous solutions exists in multi-objective optimization problems. Each solution represents a particular performance trade-off between the objectives and can be considered optimal. In this paper, the performance of a recently developed teaching–learning-based optimization (TLBO) algorithm is evaluated against the other optimization algorithms over a set of multi-objective unconstrained and constrained test functions and the results are compared. The TLBO algorithm was observed to outperform the other optimization algorithms for the multi-objective unconstrained and constrained benchmark problemsen_US
dc.subjectTeaching–learning-baseden_US
dc.subjectoptimizationen_US
dc.subjectMulti-objectiveen_US
dc.subjectoptimizationen_US
dc.subjectUnconstrained anden_US
dc.subjectconstrained benchmarken_US
dc.subjectfunctionsen_US
dc.titleA comparative study of a teaching–learning-based optimization algorithm on multi-objective unconstrained and constrained functionsen_US
Appears in Collections:Mechnical

Files in This Item:
File Description SizeFormat 
13_14_3 A comparative study of a teaching–learning-based optimization.pdf2.11 MBUnknownView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.