DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorPei, Junen_US
dc.contributor.authorPardalos, Panos M.en_US
dc.contributor.authorUrošević, Draganen_US
dc.date.accessioned2021-11-24T09:21:23Z-
dc.date.available2021-11-24T09:21:23Z-
dc.date.issued2022-
dc.identifier.issn1862-4472-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4708-
dc.description.abstractThe main idea of Less is more approach (LIMA) is using as fewer as possible ingredients to provide the best possible outcome. This approach has been used successfully almost in all the scientific and art disciplines. Recently, the idea has also been successfully explored in solving hard optimization problems. In this note we first define the dominance relation between two algorithms that includes their simplicity as well. Then we propose the general LIMA algorithm and discuss automatic ways to include common ingredients of all search algorithms, increasing the algorithms complexity in a systematic way. That kind of approach may represent a road from Optimization to Artificial Intelligence and Machine learning. Finally, we illustrate LIMA algorithm on two optimization problems and show its efficiency.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofOptimization Lettersen_US
dc.subjectArtificial intelligence | Less is more approach | Metaheuristics | Optimization | Variable neighborhood searchen_US
dc.titleLess is more approach in optimization: a road to artificial intelligenceen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s11590-021-01818-w-
dc.identifier.scopus2-s2.0-85119020242-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage409-
dc.relation.lastpage420-
dc.relation.volume16-
dc.description.rankM22-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

3
checked on Jun 20, 2024

Page view(s)

143
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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