Show simple item record

dc.contributor.authorEsmaelian M
dc.contributor.authorTavana M
dc.contributor.authorSantos Arteaga FJ
dc.contributor.authorVali M
dc.contributor.editor
dc.date.accessioned2019-06-24T12:29:24Z
dc.date.available2019-06-24T12:29:24Z
dc.date.issued2018
dc.identifier.issn0263-2241
dc.identifier.urihttp://dx.doi.org/10.1016/j.measurement.2017.09.034
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0263224117306061?via=ihub
dc.identifier.urihttp://hdl.handle.net/10863/10200
dc.description.abstractWe introduce a novel method called subdividing labeling genetic algorithm (SLGA) to solve optimization problems involving n - dimensional continuous nonlinear functions. SLGA is based on the mutation and crossover operators of genetic algorithms, which are applied on a subdivided search space where an integer label is defined on a polytope built on the n - dimensional space. The SLGA method approaches a global optimal solution by reducing the feasible search region in each iteration. One of its main advantages is that it does not require computing the derivatives of the objective function to guarantee convergence. We apply the SLGA method to solve optimization problems involving complex combinatorial and large-scale systems and illustrate numerically how it outperforms several other competing algorithms such as Differential Evolution even when considering problems with a large number of elements.en_US
dc.languageEnglish
dc.language.isoenen_US
dc.relation
dc.rights
dc.titleA Novel Genetic Algorithm Based Method for Solving Continuous Nonlinear Optimization Problems Through Subdividing and Labelingen_US
dc.typeArticleen_US
dc.date.updated2019-06-14T03:00:31Z
dc.publication.title
dc.language.isiEN-GB
dc.journal.titleMeasurement
dc.description.fulltextnoneen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record