Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 185

The DOI matches its Crossref record.

Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways

Renders, J.-M., Bersini, H. · 2002 · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence

Abstract

Two methods of hybridizing genetic algorithms (GA) with hill-climbing for global optimization are investigated. The first one involves two interwoven levels of optimization-evolution (GA) and individual learning (hill-climbing)-which cooperate in the global optimization process. The second one consists of modifying a GA by the introduction of new genetic operators or by the alteration of traditional ones in such a way that these new operators capture the basic mechanisms of hill-climbing. The simplex-GA is one of the possibilities explained and tested. These two methods are applied and compared for the maximization of complex functions defined in high-dimensional real space.>

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icec.1994.349948

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 185

Metadata

Authors
Renders, J.-M., & Bersini, H.
Venue
Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
Publisher
IEEE
Published
2002-12-17
Pages
312-317
OpenAlex
W1781059203
Cited by
185
References
0
FWCI
9.51
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. https://app.cochat.ai/papers/10.1109/icec.1994.349948
The paper
Renders, J.-M., & Bersini, H. (2002). Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence. https://doi.org/10.1109/icec.1994.349948

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.