Journal article · 2017

Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions

Marjan Kaedi, Chang Wook Ahn

Applied Soft Computing, 61, 1125–1138 · Published 31 March 2017 · DOI 10.1016/j.asoc.2017.03.042

View at the publisherCite this paper

In brief

“Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions” is a 2017 journal article by Marjan Kaedi and Chang Wook Ahn, published in Applied Soft Computing. OpenAlex counts 10 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
10
Most cited in
2026 (3)
Field-weighted impact
0.51
References
44
Authors
2

Cite this paper

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

APA 7

Kaedi, M., & Ahn, C. W. (2017). Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions. Applied Soft Computing, 61, 1125–1138. https://doi.org/10.1016/j.asoc.2017.03.042

MLA 9

Kaedi, Marjan, and Chang Wook Ahn. “Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions.” Applied Soft Computing, vol. 61, 2017, pp. 1125–1138. https://doi.org/10.1016/j.asoc.2017.03.042.

Chicago

Kaedi, Marjan and Chang Wook Ahn. 2017. “Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions.” Applied Soft Computing 61: 1125–1138. https://doi.org/10.1016/j.asoc.2017.03.042.

Harvard

Kaedi, M. and Ahn, C. W. (2017) ‘Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions’, Applied Soft Computing, 61, pp. 1125–1138. doi:10.1016/j.asoc.2017.03.042.

IEEE

M. Kaedi and C. W. Ahn, “Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions,” Applied Soft Computing, vol. 61, pp. 1125–1138, 2017, doi: 10.1016/j.asoc.2017.03.042.

BibTeX

@article{kaedi2017robust,
  title     = {{Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions}},
  author    = {Kaedi, Marjan and Ahn, Chang Wook},
  journal   = {Applied Soft Computing},
  year      = {2017},
  volume    = {61},
  pages     = {1125--1138},
  doi       = {10.1016/j.asoc.2017.03.042},
  url       = {https://doi.org/10.1016/j.asoc.2017.03.042}
}

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

Citations by year

YearCitationsShare of the best year
201822
202022
202122
202511
202633

Its field-weighted citation impact is 0.51: it has been cited 0.51 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

  • Bayesian optimization
  • Bayesian networks
  • computation time reduction
  • robust solutions

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?

Kaedi, M., & Ahn, C. W. (2017). Robust optimization using Bayesian optimization algorithm: Early detection of non-robust solutions. Applied Soft Computing, 61, 1125–1138. https://doi.org/10.1016/j.asoc.2017.03.042

How many times has this paper been cited?

10 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?

Marjan Kaedi, Chang Wook Ahn.

What is the DOI of this paper?

10.1016/j.asoc.2017.03.042, permanently at https://doi.org/10.1016/j.asoc.2017.03.042. 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.