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

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms

Lara, A., Sanchez, G., Coello Coello, C.A., Schutze, O. · 2010 · IEEE Transactions on Evolutionary Computation

Abstract

In this paper, we propose and investigate a new local search strategy for multiobjective memetic algorithms. More precisely, we suggest a novel iterative search procedure, known as theHill Climber with Sidestep(HCS), which is designed for the treatment of multiobjective optimization problems, and show further two possible ways to integrate the HCS into a given evolutionary strategy leading to new memetic (or hybrid) algorithms. The pecularity of the HCS is that it is intended to be capable both moving toward and along the (local) Pareto set depending on the distance of the current iterate toward this set. The local search procedure utilizes the geometry of the directional cones of such optimization problems and works with or without gradient information. Finally, we present some numerical results on some well-known benchmark problems, indicating the strength of the local search strategy as a standalone algorithm as well as its benefit when used within a MOEA. For the latter we use the state of the art algorithms Nondominated Sorting Genetic Algorithm-II and Strength Pareto Evolutionary Algorithm 2 as base MOEAs.

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/tevc.2009.2024143

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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

Cites

Show all 3 references

Cited by

See all 187

Metadata

Authors
Lara, A., Sanchez, G., Coello Coello, C. A., & Schutze, O.
Venue
IEEE Transactions on Evolutionary Computation
Published
2010-02
Volume
14
Issue
1
Pages
112-132
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2169574584
Cited by
187
References
3
FWCI
14.49
Type
journal article
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: HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms. https://app.cochat.ai/papers/10.1109/tevc.2009.2024143
The paper
Lara, A., Sanchez, G., Coello Coello, C. A., & Schutze, O. (2010). HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2009.2024143

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.