The DOI matches its Crossref record.
A genetic algorithm for the linear transportation problem
Abstract
Genetic algorithms are adaptive procedures that find solutions to problems by an evolutionary process based on natural selection. The use of alternative genetic algorithms for solving the linear transportation problem is discussed. Using it as an example the relationship between representation structures and genetic operators is investigated for constrained problems, and the value of structures richer than bitstrings is demonstrated.>
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.
Integrity signals
Registry
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.
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
An introduction to simulated evolutionary optimization
Fogel, D. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265956 · Cited by 1,503
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Tang, L., Zhao, Y., & Liu, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2250977 · Cited by 287
Ensemble system based on genetic algorithm for stock market forecasting
Gonzalez, R. T., Padilha, C. A., & Barone, D. A. C. (2015) · 2015 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2015.7257276 · Cited by 27
Metadata
- Authors
- Vignaux, G. A., & Michalewicz, Z.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1991
- Volume
- 21
- Issue
- 2
- Pages
- 445-452
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2139248159
- Cited by
- 239
- References
- 0
- FWCI
- 7.95
- 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 genetic algorithm for the linear transportation problem. https://app.cochat.ai/papers/10.1109/21.87092
- The paper
- Vignaux, G. A., & Michalewicz, Z. (1991). A genetic algorithm for the linear transportation problem. IEEE Transactions on Systems, Man, and Cybernetics. https://doi.org/10.1109/21.87092
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.