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

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

A New Genetic Algorithm for the Quadratic Assignment Problem

Drezner, Zvi·2003·INFORMS Journal on Computing

Abstract

In this paper we propose several variants of a new genetic algorithm for the solution of the quadratic assignment problem. We designed a special merging rule for creating an offspring that exploits the special structure of the problem. We also designed a new type of a tabu search, which we term a concentric tabu search. This tabu search is applied on the offspring before consideration for inclusion in the population. The algorithm provided excellent results for a set of 29 test problems having between 30 and 100 facilities.

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.1287/ijoc.15.3.320.16076

Cites

2 of 2 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

Cited by

See all 179

Metadata

Authors
Drezner, Z.
Venue
INFORMS Journal on Computing
Published
2003-08
Volume
15
Issue
3
Pages
320-330
ISSN
  • 0899-1499 (ISSN-L)
  • 1091-9856
  • 1526-5528
OpenAlex
W2123478933
Cited by
179
References
2
FWCI
13.43
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: A New Genetic Algorithm for the Quadratic Assignment Problem. https://app.cochat.ai/papers/10.1287/ijoc.15.3.320.16076
The paper
Drezner, Z. (2003). A New Genetic Algorithm for the Quadratic Assignment Problem. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.15.3.320.16076

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.