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

The DOI matches its Crossref record.

Applying the genetic approach to simulated annealing in solving some NP-hard problems

Feng-Tse Lin, Cheng-Yan Kao, Ching-Chi Hsu·1993·IEEE Transactions on Systems, Man, and Cybernetics

Abstract

A stochastic approach called the annealing-genetic algorithm is presented for solving some well-known combinatorial optimization problems. This approach incorporates genetic algorithms into simulated annealing to improve the performance of simulated annealing. The authors' approach can be viewed as a simulated annealing algorithm with population-based state transition and with genetic-operator-based quasi-equilibrium control and as a genetic algorithm with the Boltzmann-type selection operator. The goals of efficiency in the algorithm are (1) the gap between final solution and the optimal solution should be around 3% or less, and (2) the computation time should be bounded by a polynomial function of the problem size. Empirically, the error rate of the proposed annealing-genetic algorithm for solving the multiconstraint zero-one knapsack problem is less than 1%, for solving the set partitioning problem is less than 0.1%, and for solving the traveling salesman problem is around 3%.>

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/21.257766

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 252

Metadata

Authors
Lin, F.-T., Kao, C.-Y., & Hsu, C.-C.
Venue
IEEE Transactions on Systems, Man, and Cybernetics
Published
1993
Volume
23
Issue
6
Pages
1752-1767
ISSN
0018-9472 (ISSN-L)
OpenAlex
W2142246791
Cited by
252
References
0
FWCI
5.92
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: Applying the genetic approach to simulated annealing in solving some NP-hard problems. https://app.cochat.ai/papers/10.1109/21.257766
The paper
Lin, F.-T., Kao, C.-Y., & Hsu, C.-C. (1993). Applying the genetic approach to simulated annealing in solving some NP-hard problems. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/21.257766

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.