Bibliography
Ajith Abraham, Lakhmi Jain, and Robert Goldberg, editors. Evolutionary Multiobjective Optimization, Theoretical Advances and Applications. Advanced Information and Knowledge Processing. Springer, 2005.
J. Baker. Reducing bias and inefficiency in the selection algorithm. In J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, pages 14–21, Hillsdale, New Jersey, 1987. Lawrence Erlbaum Associates.
Richard K. Belew and Lashon B. Booker, editors. Proceedings of the Fourth International Conference on Genetic Algorithms (ICGA). Morgan Kaufmann, San Diego, CA, July 1991.
James C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2):154–160, 1994.
Thomas Bäck and Frank Hoffmeister. Extended selection mechanisms in genetic algorithms. In Richard K. Belew and Lashon B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms (ICGA), pages 92–99. Morgan Kaufmann, San Diego, CA, July 1991.
Christian Blum, editor. Genetic and Evolutionary Computation GECCO 2013. ACM, Amsterdam, The Netherlands, July 2013.
Julian Blank, Kalyanmoy Deb, and Proteek Chandan Roy. Investigating the normalization procedure of NSGA-III. In Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, editors, Evolutionary Multi-Criterion Optimization, 10th International Conference (EMO), volume 11411 of Lecture Notes in Computer Science, pages 229–240. Springer, East Lansing, MI, USA, March 2019.
Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipič, and Jim Smith, editors. Parallel Problem Solving from Nature – PPSN XIII, volume 8672 of Lecture Notes in Computer Science. Springer, Ljubljana, Slovenia, September 2014.
Maxim Buzdalov and Anatoly Shalyto. A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In Bartz-Beielstein et al. [BBFS14], pages 528–537.
IEEE Congress on Evolutionary Computation (CEC). IEEE, Seoul, South Korea, May 2001.
IEEE International Conference on Evolutionary Computation (CEC). Vancouver, BC, Canada, July 2006.
First IEEE Congress on Evolutionary Computation (CEC). IEEE, Orlando, FL, June 1994.
Vincent A. Cicirello. Non-wrapping order crossover: An order preserving crossover operator that respects absolute position. In Keijzer [Kei06], pages 1125–1131.
Kalyanmoy Deb and Debayan Deb. Analysing mutation schemes for real-parameter genetic algorithms. International Journal of Artificial Intelligence and Soft Computing, 4(1):1–28, February 2014.
Indraneel Das and J. E. Dennis. Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM Journal on Optimization, 8(3):631–657, August 1998.
Kalyanmoy Deb and Ram Bushan Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9(2):115–148, 1995.
Lawrence Davis. Applying adaptive algorithms to epistatic domains. In [IJC85], pages 162–164.
Lawrence Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
Lawrence Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms [Dav91], chapter 6, pages 72–90.
Kalyanmoy Deb. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2–4):311–338, June 2000.
Kenneth Alan De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Dissertation, University of Michigan, 1975.
Kalyanmoy Deb and Mayank Goyal. A combined genetic adaptive search (GeneAS) for engineering design. Computer Science and Informatics, 26(4):30–45, 1996.
Kalyanmoy Deb and Himanshu Jain. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4):577–601, August 2014.
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182–197, April 2002.
Kalyanmoy Deb, Lothar Thiele, Marco Laumanns, and Eckart Zitzler. Scalable test problems for evolutionary multiobjective optimization. In Abraham et al. [AJG05], pages 105–145.
Larry J. Eshelman and J. David Schaffer. Preventing premature convergence in genetic algorithms by preventing incest. In Belew and Booker [BB91], pages 115–122.
Félix-Antoine Fortin, Simon Grenier, and Marc Parizeau. Generalizing the improved run-time complexity algorithm for non-dominated sorting. In Blum [Blu13], pages 615–622.
Vladimir Filipović, Jozef Kratica, Dušan Tošić, and Ivana Ljubić. Fine grained tournament selection for the simple plant location problem. In 5th Online World Conference on Soft Computing Methods in Industrial Applications, pages 152–158. January 2000.
M. Flynn. Some computer organizations and their effectiveness. IEEE Transactions on Computers, 21:948–960, 1972.
Carlos Fernandes and Agostinho Rosa. A study on non-random mating and varying population size in genetic algorithms using a royal road function. In [CEC01], pages 60–66.
Carlos Fernandes, Rui Tavares, Cristian Munteanu, and Agostinho Rosa. Using assortative mating in genetic algorithms for vector quantization problems. In Proceedings of the 2001 ACM symposium on Applied computing (SAC ’01), pages 361–365, March 2001.
John J. Grefenstette and James E. Baker. How genetic algorithms work: a critical look at implicit parallelism. In Schaffer [Sch89], pages 20–27.
David E. Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in genetic algorithms. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms (FOGA 1), volume 1, pages 69–93. Elsevier, 1991.
John Grefenstette, Rajeev Gopal, Brian Rosmaita, and Dirk Van Gucht. Genetic algorithms for the traveling salesman problem. In Grefenstette [Gre85], pages 160–168.
David E. Goldberg, Bradley Korb, and Kalyanmoy Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493–530, 1989.
David E. Goldberg and Robert Lingle. Alleles, loci, and the traveling salesman problem. In Grefenstette [Gre85], pages 154–159.
W. Gropp, E. Lusk, and A. Skjellum. Using MPI Portable Parallel Programming with the Message-Passing Interface. The MIT Press, Cambrigde, 1994.
David E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. Addison Wesley, October 1989.
John J. Grefenstette, editor. Proceedings of the first International Conference on Genetic Algorithms (ICGA). L. Erlbaum Associates, Pittsburgh, PA, USA, July 1985.
John J. Grefenstette, editor. Proceedings of the Second International Conference on Genetic Algorithms and Their Applications (ICGA). Lawrence Erlbaum Associates, Cambridge, MA, July 1987.
Georges Harik. Finding multiple solutions in problems of bounded difficulty. IlliGAL Report 94002, Illinois Genetic Algorithm Lab, May 1994.
Georges R. Harik. Finding multimodal solutions using restricted tournament selection. In Larry J. Eshelman, editor, Proceedings of the International Conference on Genetic Algorithms (ICGA), pages 24–31. Morgan Kaufmann, July 1995.
Georges R. Harik and David E. Goldberg. Learning linkage. In Richard K. Belew and Michael D. Vose, editors, Foundations of Genetic Algorithms (FOGA) 4, pages 247–262, San Diego, CA, August 1996. Morgan Kaufmann.
J. Holland. Adaption in Natural and Artificial Systems. MIT Press, Cambrigde, 1992.
Proceedings of the Ninth International Joint Conferences on Artificial Intelligence (IJCAI), volume 1. IJCAI International Joint Conferences on Artificial Intelligence Organization, Los Angeles, California, August 1985.
F. James. A review of pseudorandom number generators. Computer Physics Communications, 60(3):329–344, October 1990.
Himanshu Jain and Kalyanmoy Deb. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation, 18(4):602–622, August 2014.
Mikkel T. Jensen. Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. IEEE Transactions on Evolutionary Computation, 7(5):503–515, October 2003.
Saku Kukkonen and Kalyanmoy Deb. Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems. In [CEC06], pages 1179–1186.
Saku Kukkonen and Kalyanmoy Deb. A fast and effective method for pruning of non-dominated solutions in many-objective problems. In Runarsson et al. [RBB+06], pages 553–562.
Maarten Keijzer, editor. Genetic and Evolutionary Computation GECCO 2006. ACM, Seattle, Washington, July 2006.
Tadahiko Murata and Hisao Ishibuchi. Performance evaluation of genetic algorithms for flowshop scheduling problems. In [CEC94], pages 812–817.
MPI: A message-passing interface standard, version 4.0. Message Passing Interface Forum, June 2021.
Message Passing Interface Forum. MPI: A message-passing interface standard. International Journal of Supercomputing Applications, 8(3/4), 1994.
MPICH homepage, last visited 2023-01-15.
George Marsaglia, Arif Zaman, and Wai Wan Tsang. Toward a universal random number generator. Statistics & Probability Letters, 9(1):35-39, January 1990.
Open MPI homepage, last visited 2023-01-15.
I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the traveling salesman problem. In Grefenstette [Gre87], page 224–230.
Martin Pelikan. Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms, volume 170 of Studies in Fuzziness and Soft Computing. Springer, 2005.
Krunoslav Puljić and Robert Manger. Comparison of eight evolutionary crossover operators for the vehicle routing problem. Mathematical Communications, 18(2):359–375, November 2013.
Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63:339–370, June 1996.
Kenneth V. Price, Rainer M. Storn, and Jouni A. Lampinen. Differential Evolution: A Practical Approach to Global Optimization. Springer, Berlin, Heidelberg, 2005.
Thomas Philip Runarsson, Hans-Georg Beyer, Edmund Burke, Juan J. Merelo-Guervós, L. Darrell Whitley, and Xin Yao, editors. Parallel Problem Solving from Nature – PPSN IX, volume 4193 of Lecture Notes in Computer Science. Springer, Reykjavik, Iceland, September 2006.
Ralf Salomon. Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. Biosystems, 39(3):263–278, 1996.
J. David Schaffer, editor. Proceedings of the Third International Conference on Genetic Algorithms (ICGA). Morgan Kaufmann, June 1989.
W. Spears and K. DeJong. On the virtues of parameterized uniform crossover. In R. Belew and L. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 230–236, San Mateo, 1991. Morgan Kaufmann.
Rainer Storn and Kenneth Price. Differential evolution – a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, International Computer Science Institute (ICSI), March 1995.
Rainer Storn and Kenneth Price. Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Global Optimization, 11(4):341–359, December 1997.
Fortran: integer*4 vs integer(4) vs integer(kind=4), stackoverflow Article from 2010, last visited 2023-01-14.
Artem Sokolov and Darrell Whitley. Unbiased tournament selection. In Hans-Georg Beyer, editor, Genetic and Evolutionary Computation GECCO 2005), page 1131–1138, Washington DC, June 2005. ACM.
Gilbert Syswerda. Uniform crossover in genetic algorithms. In Schaffer [Sch89], pages 2–9.
Gilbert Syswerda. Schedule optimization using genetic algorithms. In Davis [Dav91], chapter 21, pages 332–349.
Ryoji Tanabe and Alex Fukunaga. Reevaluating exponential crossover in differential evolution. In Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipič, and Jim Smith, editors, Parallel Problem Solving from Nature – PPSN XIII, volume 8672 of Lecture Notes in Computer Science, pages 201–210. Springer, Ljubljana, Slovenia, September 2014.
Tetsuyuki Takahama and Setsuko Sakai. Constrained optimization by the \(\epsilon\) constrained differential evolution with gradient-based mutation and feasible elites. In IEEE International Conference on Evolutionary Computation (CEC). Vancouver, BC, Canada, July 2006.
Tetsuyuki Takahama and Setsuko Sakai. Constrained optimization by the \(\epsilon\) constrained differential evolution with an archive and gradient-based mutation. In IEEE Congress on Evolutionary Computation (CEC), Barcelona, Spain, July 2010.
Jeffrey Scott Vitter. An efficient algorithm for sequential random sampling. ACM Transactions on Mathematical Software, 13(1):58–67, March 1987.
John von Neumann. Various techniques used in connection with random digits. In A. S. Householder, G. E. Forsythe, and H. H. Germond, editors, Monte Carlo Method, volume 12 of National Bureau of Standards Applied Mathematics Series, chapter 13, pages 36–38. US Government Printing Office, Washington, DC, June 1951.
Darrell Whitley. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In Schaffer [Sch89], pages 116-121.
GENITOR: A different genetic algorithm. In Rocky Mountain Conference on Artificial Intelligence, pages 118–130, Denver, 1988.
Darrel Whitley, Timothy Starkweather, and Daniel Shaner. The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. In Davis [Dav91] chapter 22, pages 350–372.