Journal article · 2006

Memetic algorithm using multi-surrogates for computationally expensive optimization problems

Zongzhao Zhou, Yew-Soon Ong, Meng Hiot Lim, Bu‐Sung Lee

Soft Computing, 11(10), 957–971 · Published 15 December 2006 · DOI 10.1007/s00500-006-0145-8

View at the publisherCite this paper

In brief

“Memetic algorithm using multi-surrogates for computationally expensive optimization problems” is a 2006 journal article by Zongzhao Zhou and 3 co-authors, published in Soft Computing. OpenAlex counts 157 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
157
Most cited in
2018 (12)
Field-weighted impact
8.21
References
33
Authors
4

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhou, Z., Ong, Y.-S., Lim, M. H., & Lee, B. (2006). Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Computing, 11(10), 957–971. https://doi.org/10.1007/s00500-006-0145-8

MLA 9

Zhou, Zongzhao, et al. “Memetic algorithm using multi-surrogates for computationally expensive optimization problems.” Soft Computing, vol. 11, no. 10, 2006, pp. 957–971. https://doi.org/10.1007/s00500-006-0145-8.

Chicago

Zhou, Zongzhao, Yew-Soon Ong, Meng Hiot Lim, and Bu‐Sung Lee. 2006. “Memetic algorithm using multi-surrogates for computationally expensive optimization problems.” Soft Computing 11 (10): 957–971. https://doi.org/10.1007/s00500-006-0145-8.

Harvard

Zhou, Z. et al. (2006) ‘Memetic algorithm using multi-surrogates for computationally expensive optimization problems’, Soft Computing, 11(10), pp. 957–971. doi:10.1007/s00500-006-0145-8.

IEEE

Z. Zhou, Y.-S. Ong, M. H. Lim, and B. Lee, “Memetic algorithm using multi-surrogates for computationally expensive optimization problems,” Soft Computing, vol. 11, no. 10, pp. 957–971, 2006, doi: 10.1007/s00500-006-0145-8.

BibTeX

@article{zhou2006memetic,
  title     = {{Memetic algorithm using multi-surrogates for computationally expensive optimization problems}},
  author    = {Zhou, Zongzhao and Ong, Yew-Soon and Lim, Meng Hiot and Lee, Bu‐Sung},
  journal   = {Soft Computing},
  year      = {2006},
  volume    = {11},
  number    = {10},
  pages     = {957--971},
  doi       = {10.1007/s00500-006-0145-8},
  url       = {https://doi.org/10.1007/s00500-006-0145-8}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201777
20181212
201988
202055
202111
202222
202355
202444
202522
202622

Its field-weighted citation impact is 8.21: it has been cited 8.21 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research

  • hybrid genetic algorithm
  • computationally expensive optimization
  • surrogate-assisted evolutionary optimization
  • Lamarckian learning
  • local search

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Zhou, Z., Ong, Y.-S., Lim, M. H., & Lee, B. (2006). Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Computing, 11(10), 957–971. https://doi.org/10.1007/s00500-006-0145-8

How many times has this paper been cited?

157 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Zongzhao Zhou, Yew-Soon Ong, Meng Hiot Lim, Bu‐Sung Lee.

What is the DOI of this paper?

10.1007/s00500-006-0145-8, permanently at https://doi.org/10.1007/s00500-006-0145-8. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.