The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A real coded genetic algorithm for solving integer and mixed integer optimization problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Cited by 957
A new crossover operator for real coded genetic algorithms
Deep, K., & Thakur, M. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.10.047 · Cited by 419
Self-citationA new mutation operator for real coded genetic algorithms
Deep, K., & Thakur, M. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.03.046 · Cited by 389
Self-citationGlobal optimization by controlled random search
Price, W. L. (1983) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933504 · Cited by 355
Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems
Costa, L., & Oliveira, P. (2001) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00653-0 · Cited by 213
An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints
Yiqing, L., Xigang, Y., & Yongjian, L. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.05.016 · Cited by 197
A simulated annealing approach to the solution of minlp problems
Cardoso, M. F., Salcedo, R., de Azevedo, S. F., & Barbosa, D. (1997) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(97)00015-x · Cited by 181
Optimization models for reliability of modular software systems
Berman, O., & Ashrafi, N. (1993) · IEEE Transactions on Software Engineering · doi:10.1109/32.256858 · Cited by 108
Solving mixed integer nonlinear programming problems with line-up competition algorithm
Yan, L., Shen, K., & Hu, S. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.07.027 · Cited by 33
Cited by
Lei, S., Chen, C., Li, Y., & Hou, Y. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2899353 · Cited by 427
A survey on computation offloading modeling for edge computing
Lin, H., Zeadally, S., Chen, Z., Labiod, H., & Wang, L. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102781 · Cited by 305
An efficient optimization approach for designing machine learning models based on genetic algorithm
Hamdia, K. M., Zhuang, X., & Rabczuk, T. (2021) · Neural Computing and Applications · doi:10.1007/s00521-020-05035-x · Cited by 301
Guo, F., Zhang, H., Ji, H., Li, X., & Leung, V. C. M. (2018) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2018.2873002 · Cited by 292
Hybrid constellation design using a genetic algorithm for a LEO-based navigation augmentation system
Ma, F., Zhang, X., Li, X., Cheng, J., Guo, F., Hu, J., & Pan, L. (2020) · GPS Solutions · doi:10.1007/s10291-020-00977-0 · Cited by 82
Metadata
- Authors
- Deep, K., Singh, K. P., Kansal, M. L., & Mohan, C.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2009-06
- Volume
- 212
- Issue
- 2
- Pages
- 505-518
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2040734884
- Cited by
- 683
- References
- 21
- FWCI
- 11.57
- 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
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.