A random forest assisted evolutionary algorithm using competitive neighborhood search for expensive constrained combinatorial optimization
Memetic Computing · 2021-03 · 13 (1) · 19-30
DOI: 10.1007/s12293-021-00326-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Memetic Computing, online erschienen am 25.01.2021. Verfasst von Lei Han und 1 weiteren Autor:innen. Die Arbeit wurde bisher 32-mal zitiert (Crossref) und nennt 72 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Han, L., & Wang, H. (2021). A random forest assisted evolutionary algorithm using competitive neighborhood search for expensive constrained combinatorial optimization. Memetic Computing, 13(1), 19-30. https://doi.org/10.1007/s12293-021-00326-9
Vancouver
Han L, Wang H. A random forest assisted evolutionary algorithm using competitive neighborhood search for expensive constrained combinatorial optimization. Memetic Computing. 2021;13(1):19-30. doi:10.1007/s12293-021-00326-9
BibTeX
@article{Han2021,
author = {Han, Lei and Wang, Handing},
title = {A random forest assisted evolutionary algorithm using competitive neighborhood search for expensive constrained combinatorial optimization},
journal = {Memetic Computing},
year = {2021},
volume = {13},
number = {1},
pages = {19--30},
doi = {10.1007/s12293-021-00326-9}
}
EUVIMED