Crossover (evolutionary algorithm) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Crossover (evolutionary algorithm)" in English language version.

Last modified: 13:42:03, 27 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1912doi.org

2^nd place

168worldcat.org

4^th place

147springer.com

182^nd place

172^nd place

125semanticscholar.org

15^th place

8^th place

11mit.edu

476^th place

340^th place

11complex-systems.com

low place

11tu-dortmund.de

low place

complex-systems.com (Global: low place; English: low place)

Goldberg, David E. (1991). "Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking". Complex Syst. 5 (2): 139–167.

doi.org (Global: 2^nd place; English: 2^nd place)

Eiben, A.E.; Smith, J.E. (2015). "Representation, Mutation, and Recombination". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 49–78. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Yu, Xinjie; Gen, Mitsuo (2010). "Encoding and Operators". Introduction to evolutionary algorithms. Decision Engineering. London: Springer. pp. 40–63. doi:10.1007/978-1-84996-129-5. ISBN 978-1-84996-129-5. OCLC 654380156.
Yu, Xinjie; Gen, Mitsuo (2010). "Variation Operators for Permutation Code". Introduction to Evolutionary Algorithms. Decision Engineering. London: Springer. pp. 285–299. doi:10.1007/978-1-84996-129-5. ISBN 978-1-84996-128-8.
Eiben, A.E.; Smith, J.E. (2015). "Recombination Operators for Real-Valued Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 65–67. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Yu, Xinjie; Gen, Mitsuo (2010). "Real Code and Related Operators". Introduction to Evolutionary Algorithms. Decision Engineering. London: Springer. pp. 45–63. doi:10.1007/978-1-84996-129-5. ISBN 978-1-84996-128-8.
Mühlenbein, Heinz; Schlierkamp-Voosen, Dirk (1993). "Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization". Evolutionary Computation. 1 (1): 25–49. doi:10.1162/evco.1993.1.1.25. ISSN 1063-6560. S2CID 16085506.
Larrañaga, P.; Kuijpers, C.M.H.; Murga, R.H.; Inza, I.; Dizdarevic, S. (1999). "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators". Artificial Intelligence Review. 13 (2): 129–170. doi:10.1023/A:1006529012972. S2CID 10284682.
Atkinson, M.D. (January 1999). "Restricted permutations". Discrete Mathematics. 195 (1): 27–38. doi:10.1016/S0012-365X(98)00162-9.
Eiben, A.E.; Smith, J.E. (2015). "Recombination for Permutation Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 70–74. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Jakob, Wilfried; Quinte, Alexander; Stucky, Karl-Uwe; Süß, Wolfgang (2008), "Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm", in Rudolph, Günter; Jansen, Thomas; Beume, Nicola; Lucas, Simon (eds.), Parallel Problem Solving from Nature – PPSN X, vol. LNCS 5199, Berlin, Heidelberg: Springer, pp. 1031–1040, doi:10.1007/978-3-540-87700-4_102, ISBN 978-3-540-87699-1, retrieved 2023-01-14
Dzubera, John; Whitley, Darrell (1994), "Advanced correlation analysis of operators for the traveling salesman problem", in Davidor, Yuval; Schwefel, Hans-Paul; Männer, Reinhard (eds.), Parallel Problem Solving from Nature — PPSN III, vol. 866, Berlin, Heidelberg: Springer, pp. 68–77, doi:10.1007/3-540-58484-6_251, ISBN 978-3-540-58484-1, retrieved 2023-01-15
Riazi, Amin (14 October 2019). "Genetic algorithm and a double-chromosome implementation to the traveling salesman problem". SN Applied Sciences. 1 (11) 1397. doi:10.1007/s42452-019-1469-1.

mit.edu (Global: 476^th place; English: 340^th place)

direct.mit.edu

Mühlenbein, Heinz; Schlierkamp-Voosen, Dirk (1993). "Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization". Evolutionary Computation. 1 (1): 25–49. doi:10.1162/evco.1993.1.1.25. ISSN 1063-6560. S2CID 16085506.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Eiben, A.E.; Smith, J.E. (2015). "Representation, Mutation, and Recombination". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 49–78. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Eiben, A.E.; Smith, J.E. (2015). "Recombination Operators for Real-Valued Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 65–67. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Mühlenbein, Heinz; Schlierkamp-Voosen, Dirk (1993). "Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization". Evolutionary Computation. 1 (1): 25–49. doi:10.1162/evco.1993.1.1.25. ISSN 1063-6560. S2CID 16085506.
Larrañaga, P.; Kuijpers, C.M.H.; Murga, R.H.; Inza, I.; Dizdarevic, S. (1999). "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators". Artificial Intelligence Review. 13 (2): 129–170. doi:10.1023/A:1006529012972. S2CID 10284682.
Eiben, A.E.; Smith, J.E. (2015). "Recombination for Permutation Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 70–74. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Eiben, A.E.; Smith, J.E. (2015). "Representation, Mutation, and Recombination". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 49–78. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Yu, Xinjie; Gen, Mitsuo (2010). "Variation Operators for Permutation Code". Introduction to Evolutionary Algorithms. Decision Engineering. London: Springer. pp. 285–299. doi:10.1007/978-1-84996-129-5. ISBN 978-1-84996-128-8.
Eiben, A.E.; Smith, J.E. (2015). "Recombination Operators for Real-Valued Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 65–67. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Larrañaga, P.; Kuijpers, C.M.H.; Murga, R.H.; Inza, I.; Dizdarevic, S. (1999). "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators". Artificial Intelligence Review. 13 (2): 129–170. doi:10.1023/A:1006529012972. S2CID 10284682.
Eiben, A.E.; Smith, J.E. (2015). "Recombination for Permutation Representation". Introduction to Evolutionary Computing. Natural Computing Series (2nd ed.). Berlin, Heidelberg: Springer. pp. 70–74. doi:10.1007/978-3-662-44874-8. ISBN 978-3-662-44873-1. S2CID 20912932.
Jakob, Wilfried; Quinte, Alexander; Stucky, Karl-Uwe; Süß, Wolfgang (2008), "Fast Multi-objective Scheduling of Jobs to Constrained Resources Using a Hybrid Evolutionary Algorithm", in Rudolph, Günter; Jansen, Thomas; Beume, Nicola; Lucas, Simon (eds.), Parallel Problem Solving from Nature – PPSN X, vol. LNCS 5199, Berlin, Heidelberg: Springer, pp. 1031–1040, doi:10.1007/978-3-540-87700-4_102, ISBN 978-3-540-87699-1, retrieved 2023-01-14
Dzubera, John; Whitley, Darrell (1994), "Advanced correlation analysis of operators for the traveling salesman problem", in Davidor, Yuval; Schwefel, Hans-Paul; Männer, Reinhard (eds.), Parallel Problem Solving from Nature — PPSN III, vol. 866, Berlin, Heidelberg: Springer, pp. 68–77, doi:10.1007/3-540-58484-6_251, ISBN 978-3-540-58484-1, retrieved 2023-01-15

tu-dortmund.de (Global: low place; English: low place)

ls11-www.cs.tu-dortmund.de

Schwefel, Hans-Paul (1995). Evolution and optimum seeking. New York: Wiley. ISBN 0-471-57148-2. OCLC 30701094.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Davis, Lawrence (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold. ISBN 0-442-00173-8. OCLC 23081440.
Yu, Xinjie; Gen, Mitsuo (2010). "Encoding and Operators". Introduction to evolutionary algorithms. Decision Engineering. London: Springer. pp. 40–63. doi:10.1007/978-1-84996-129-5. ISBN 978-1-84996-129-5. OCLC 654380156.
Booker, Lashon B.; Fogel, David B.; Whitley, Darrell; Angeline, Peter J.; Eiben, A.E. (2000). "Recombination". In Bäck, Thomas; Fogel, David B.; Michalewicz, Zbigniew (eds.). Evolutionary computation. Vol. 1, Basic algorithms and operators. Bristol: Institute of Physics Pub. pp. 256–307. ISBN 0-585-30560-9. OCLC 45730387.
Mühlenbein, Heinz; Schlierkamp-Voosen, Dirk (1993). "Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization". Evolutionary Computation. 1 (1): 25–49. doi:10.1162/evco.1993.1.1.25. ISSN 1063-6560. S2CID 16085506.
Stender, J.; Hillebrand, E.; Kingdon, J. (1994). Genetic algorithms in optimisation, simulation, and modelling. Amsterdam: IOS Press. ISBN 90-5199-180-0. OCLC 47216370.
Schwefel, Hans-Paul (1995). Evolution and optimum seeking. New York: Wiley. ISBN 0-471-57148-2. OCLC 30701094.
Goldberg, David E.; Lingle, R. (1985), "Alleles, loci, and the traveling salesman problem", in Grefenstette, John J. (ed.), Proceedings of the First International Conference on Genetic Algorithms and Their Applications (ICGA), Hillsdale, N.J.: Lawrence Erlbaum Associates, pp. 154–159, ISBN 0-8058-0426-9, OCLC 19702892
Syswerda, Gilbert (1991). "Schedule Optimization Using Genetic Algorithms". In Davis, Lawrence (ed.). Handbook of genetic algorithms. New York: Van Nostrand Reinhold. pp. 332–349. ISBN 0-442-00173-8. OCLC 23081440.