DC Field | Value | Language |
---|---|---|
dc.contributor.author | Coelho, Vitor Nazário | en |
dc.contributor.author | Coelho, Igor Machado | en |
dc.contributor.author | Souza, Marcone Jamilson Freitas | en |
dc.contributor.author | Oliveira, Thays | en |
dc.contributor.author | Cota, Luciano Perdigão | en |
dc.contributor.author | Haddad, Matheus Nohra | en |
dc.contributor.author | Mladenović, Nenad | en |
dc.contributor.author | Silva, Rodrigo | en |
dc.contributor.author | Guimarães, Frederico Gadelha | en |
dc.date.accessioned | 2020-05-02T16:41:58Z | - |
dc.date.available | 2020-05-02T16:41:58Z | - |
dc.date.issued | 2016-12-01 | en |
dc.identifier.issn | 1063-6560 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/2421 | - |
dc.description.abstract | This article presents an Evolution Strategy (ES)-based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure. In view of the specific local search operators for each individual, the proposed population-based approach also fits into the context of the Memetic Algorithms. The proposed variant uses the Greedy Rand omized Adaptive Search Procedure with different greedy parameters for generating its initial population, providing an interesting exploration-exploitation balance. To validate the proposal, this framework is applied to solve three different NP-Hard combinatorial optimization problems: an Open-Pit-Mining Operational Planning Problem with dynamic allocation of trucks, an Unrelated Parallel Machine Scheduling Problem with Setup Times, and the calibration of a hybrid fuzzy model for Short-Term Load Forecasting. Computational results point out the convergence of the proposed model and highlight its ability in combining the application of move operations from distinct neighborhood structures along the optimization. The results gathered and reported in this article represent a collective evidence of the performance of the method in challenging combinatorial optimization problems from different application domains. The proposed evolution strategy demonstrates an ability of adapting the strength of the mutation disturbance during the generations of its evolution process. The effectiveness of the proposal motivates the application of this novel evolutionary framework for solving other combinatorial optimization problems. | en |
dc.publisher | MIT Press | - |
dc.relation | CNPq, Grants 306694/2013-1 and 312276/2013-3 | - |
dc.relation | FAPEMIG, Grants CEX PPM 772/15 and APQ-02449-14 | - |
dc.relation.ispartof | Evolutionary Computation | en |
dc.subject | Evolution strategies | Memetic algorithms | Neighborhood structures | Open-pitmining operational planning | Reduced variable neighborhood search | Short-term load forecasting | Unrelated parallel machine scheduling | en |
dc.title | Hybrid self-adaptive evolution strategies guided by neighborhood structures for combinatorial optimization problems | en |
dc.type | Article | en |
dc.identifier.doi | 10.1162/EVCO_a_00187 | en |
dc.identifier.pmid | 27258842 | en |
dc.identifier.scopus | 2-s2.0-85001955841 | en |
dc.relation.firstpage | 637 | en |
dc.relation.lastpage | 666 | en |
dc.relation.issue | 4 | en |
dc.relation.volume | 24 | en |
dc.description.rank | M21a | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
crisitem.author.orcid | 0000-0001-6655-0409 | - |
SCOPUSTM
Citations
13
checked on Sep 7, 2024
Page view(s)
1
checked on Sep 7, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.