Genetic algorithms for lens design: a review
 75 Downloads
Abstract
Genetic algorithms (GAs) have a long history of over four decades. GAs are adaptive heuristic search algorithms that provide solutions for optimization and search problems. The GA derives expression from the biological terminology of natural selection, crossover, and mutation. In fact, GAs simulate the processes of natural evolution. Due to their unique simplicity, GAs are applied to the search space to find optimal solutions for various problems in science and engineering. Using GAs for lens design was investigated mostly in the 1990s, but were not fully exploited. But in the past few years, there have been a number of newer studies exploring the application of GAs or hybrid GAs in optical design. In this paper, we discuss the basic ideas behind GAs and demonstrate their application in optical lens design.
Keywords
Genetic algorithm Lens optimization Lens system design Optimization strategiesIntroduction
In terms of designing optical lenses, there are many constraints and requirements, including restrictions like assembly, potential cost, manufacturing, procurement, and personal decision making [1]. Typical parameters include surface profile types such as spherical, aspheric, diffractive, or holographic. Usually, the design space for optical systems consists of multidimensional parameter space. Moreover, the radius of curvature, distance to the next surface, material type and optionally tilt, and decenter are necessary for lens design [2].
The most important aspects for designing optical lenses are optical performance or image quality, manufacturing, and environmental requisitions. Optical performance is determined by encircled energy, the modulation transfer function (MTF), ghost reflection control, pupil performance, and the Strehl ratio [3, 4]. Manufacturing requirements include weight, available types of materials, static volume, dynamic volume, center of gravity, and configuration requirements. Furthermore, environmental requirements encompass electromagnetic shielding, pressure, vibration, and temperature. Additional constraints comprise lens element center and edge thickness, and minimum and maximum air spaces between lenses. Other important design constraints are maximum constraints on entrance and exit angles, the physically realizable glass index of refraction and dispersion properties [5].
Optical designers manufacture a lens system, with all the design requirements for optical lenses, in one place. The most important part of lens design is called optimization. In the process of optimization, the values of independent variables (e.g., material between surfaces) are used to realize dependent variables such as imaging magnification [6]. Furthermore, the optimization process contains local and global minima. Global optimization is needed to find the most stable solution.
Traditionally, the most effective optimization tool is the Levenberg–Marquardt algorithm or damped least squares (DLS) method which solves nonlinear least squares problems. A disadvantage of DLS is that the designer has to tackle with the local minimum. Therefore, global optimization tools were introduced [1, 7]. Usually, an optical engineer starts from a global search algorithm with a rough initial configuration of lens design (initial glass selection, number of surfaces, field of view, a wavelength, and an exact stop position). An automatic optimization algorithm is applied to alter the configuration and to find the best or adequate solution. An initial configuration could be parallel plates of glass to control the surface curvature.
By defining many variables and a merit function, the global search algorithms, combined with computeraided design (CAD) tools, can find design forms with inadequate and many possible solutions. The optical designer needs to examine one or more optical systems by improving the adjustments and optimizations with algorithms like the Hammer algorithm [8] or by hand calculation. In contrast to traditional optimization tools, the optimization problem of lens design can be solved by the use of a genetic algorithm (GA). This specific kind of algorithm is capable of imitating the principles of biological evolution. A GA is based on repeating the modification of an individual population similar to biological reproduction. Its random nature is utilized to improve the search for a global solution [9].
Since 2015, several researchers have applied the hybrid GA to lens design [10, 11, 12]. These kinds of GAs can be effectively applied to realworld problems and contain other techniques within their frameworks. It can be argued that hybrid GAs are more efficient than other types of optimization strategies in the field of lens design. Studies have shown that hybrid GAs can be usefully applied for correcting and eliminating chromatic aberrations.
The purpose of this review is to provide an overview about GAs used in lens design, starting with the background, the optimization problem, and specific requirements of GAs. We then discuss the use of GAs in lens design.
Background
Optical lens system
A search space for lens design encompasses a multidimensional space including several peaks, nonlinearity, and a strong correlation between parameters [13]. The search for local minima is dependent on the initial point solution. Only adjacent points of the initial solution are investigated [1]. Hence, diverse applications of global search methods can be inserted in optical design. Optical software includes special algorithms to investigate beyond optima [14, 15, 16].
A typical twoelement airspaced lens with nine variables would consist of 4 radii of curvature, 2 glass types, 2 thicknesses, and 1 airspace thickness. Apart from that, a multiconfiguration lens includes corrections over the field of view and over a wide spectral band as well as over realistic temperature ranges and over a range of focal lengths. This kind of configuration indicates a complex design volume with many dimensions [5].
Predetermined constraints and parameters are necessary to create an optical lens design. Parameters would include the curvature of spherical surfaces, type of material, and element position. In addition, constraints include magnification, numerical aperture, and field of view. Economic factors incorporate cost, size, and the weight of the system elements. Moreover, the image quality depends on aberrations. The lower the aberrations, the better the image quality and the better the optical lens system [17].
Lens optimization
Typically, there are independent and dependent variables in lens design. Examples for independent variables are such as total surface number, material between surfaces, or the curvature of the surface and dependent variables such as effective focal length, back focal length, or distance from the object surface to the image surface. The most crucial part of lens design is the process of optimization. Optimization deals with receiving independent variables to discover the target values of dependent variables. If the amount of dependent variables is bigger than the amount of independent variables, it is not possible to achieve the target values of the dependent variables at the same time, and the problem becomes a least squares problem [6].
Problem areas in optimization
Optimization problems have to find the minimum solution of any dimensional problem (e.g., MinMax algorithm and least squares estimation). In the process of optimization, the global minimum or maximum solution is estimated. The global extremum is defined as a point where the function value is smaller or larger than at any other point in the search space.
The local minimum in optimization returns a function value which is smaller than at nearby points in the search space. This value should be greater than at a distant point in the search space [18]. It is necessary to find as many local minima as possible, because the merit function does not always precisely determine the lens quality. Hence, the designer should select the optimal solution among the local minima [6]. Typically, finding a global optimum within a search space of many local optima is a challenging problem for all systems which adapt and learn. A genetic algorithm can be used with the right setup to overcome this deficiency [9]. It is the task for the designer to choose a feasible design for an optical system and perform appropriate refinements through numerical modeling [4]. Moreover, the designer is in charge of fulfilling all necessary requirements and adjustments of the optimized lens design or must to restart the entire process again [5].
Since the 1940s, Baker [19], Feder [20], Wynne and Wormell [21] and Grey [22] have investigated lens optimization techniques which can overcome this problem in multidimensional space. Before the era of digital computers, lens design was calculated manually by the use of trigonometry and logarithmic tables to obtain 2D cuts through multidimensional spaces. Computerized ray tracing was introduced to facilitate quick lens modeling and the search of design space.
Optimization strategies
Usually, in nonlinear optimization problems the stateoftheart technique is called the Broyden–Fletcher–Goldfarb–Shanno algorithm [23]. This iterative method is only feasible with available derivatives. Methods like DLS, Newton methods, and variants are common algorithms [24]. Generally, a quasiNewton method is required to find the local minima and maxima of functions.
A GA, or metaheuristic, belongs to a class of evolutionary algorithms (EAs) [25] and is used to simulate and solve optimization problems by applying a population of solutions [26, 27]. In other words, the GA solves a problem which is encoded in a series of bit strings that are manipulated by the algorithm [28]. Furthermore, a GA copes with hard nonlinear, multimodal functions, as well as multiobjective optimization [1].
Genetic algorithms
GAs are both optimization algorithms and heuristic search methods for populations. They are inspired by natural processes, and in particular natural selection and genetic evolution.
Charles Darwin introduced the terminology of natural selection for the first time in his book On the Origin of Species in 1859 [29]. Every living organism is related and has a common ancestor. The theory assumes that complex creatures have gradually descended from oversimplified ancestors. Certain random mutation processes occur in the genetic organism’s code, and particular mutations are kept alive to aid in survival, with follow on generations receiving the last preserved mutations. With time, advantageous mutations will increase and cumulate to produce an entire new generation.
The term genetic algorithm was inspired by Darwin’s theory of evolution and first devised by Holland and Goldberg [30, 31]. It shows similarities to Rechenberg’s [32] Evolutionsstrategien (evolutionary strategies ESs) of 1973. Holland’s and Goldberg’s first approach to this kind of algorithm was theoretical. They used a binary code to describe individuals in a population. This work was later improved by Rechenberg [33].
GAs are applied to practical problems to assess the solution for a desired outcome, but to also improve the best solution. Examples for practical problems are image processing, prediction protein structures with three dimensions, or in verylargescale integration. By applying a GA, instead of a specific solution to a problem, the characteristics of the solution are well known. In addition, restrictions of the solutions are used to reject possible and potential solutions. GAs are mostly applied in the field with many large complex problems where conventional algorithms cannot succeed. For example, the GA can be applied in combinatorial optimization, or parameter estimation [34].
Ordinarily, a population of individuals is preserved in a certain search space for a GA. The population represents a possible solution for a given specified problem. Each individual is coded with a finite length vector of variables in the binary alphabet \(\left\{ {0,1}\right\} \). In the genetic analogy, the individuals would resemble chromosomes and variables can be compared to genes. Chromosomes consist of various genes or variables, and each chromosome is composed of a binary string. Each bit in the string is characteristic of the solution [9].
There are several benefits of using a GA over other optimization strategies. An important aspect is the use of optimization with a systematized set of continuous or discrete parameters for global optimization scenarios. It works with a large number of parameters. The result of applying a GA gives a set of solutions and is not a single solution [36]. On the other hand, high computational cost is required to look into billions of solutions which impede the optimization of hard problems. Finetuning of all parameters for the GA is associated with trials and errors [1, 37].
Procedure of a GA
 1.
Initialization A gene set is built out of a population of candidate solutions. The algorithm generates random strings from the individual solutions to form an initial population. The initialization is done randomly to cover the total range of possible solutions in the search space. Normally, the population size is not depending on the nature of the problem, but has a reasonable size of about 100–1000 optimal solutions.
 2.Selection and fitness value Individual genomes are selected from an existing population to breed the new generation. Individual solutions are selected through a fitness function within a fitnessbased process and are named fitter solutions. Selection methods are chosen to rate the fitness of each solution. The fitness value is generated to give feedback so the GA can find the best solution. Most fitness functions are stochastic methods in order to select small proportions of less fitness solutions and maintain a variety of large populations. Furthermore, these functions prohibit premature convergence on poor solutions. Additional selection methods include roulette and tournament wheel selection.

Roulette Wheel Selection The fitness level is the requirement that each individual solution is linked with a probability of selection. In this method, the fitness value for each input is calculated and depicted on the wheel in portions of percentage (Fig. 2a). The wheel is rotated and has a search space of nchromosomes. A chromosome with a high fitness value will be selected more than once.

Tournament Wheel Selection This method takes two solutions out of the pool of possible solutions. Then their fitness is compared, and the better solution will be replicated. Hence, the tournament selection chooses the best individual in each process. This approach is capable of looking at parallel architecture (Fig. 2b).

 3.
Crossover This genetic operator takes more than one parent solution and generates a child solution. Genes from parent chromosomes are taken, and a new offspring is produced. In detail, the operator selects a random crossover point (\(\vert\)). Everything in the binary string from the first chromosome before this point is copied and everything after this point from the second chromosome is copied to generate a new offspring (Table 1). It is possible to take several crossover points and ameliorate the performance of the GA by applying specific crossover on specific problems. Crossover also permits the exchange of information in solutions, similar to natural organism reproduction [34].
 4.
Mutation This operator changes a single bit randomly in the current generated offspring from the crossover operator, e.g., from 0 to 1 or from 1 to 0 (Table 2). The engine needs a way to produce a new guess by mutation the current one. The parent string is converted into an array with of parent strings, list(parent). After replacing 1 letter in this array with a random selected letter from the gene set, the result is recombined into a new string. The reason for mutation is to prevent that not all solutions of the population occur in the local optimum of the solved problem.
 5.
Termination The entire process is iterative until either the known solution has been found, the population of niterations has not changed, or a certain amount of time and generations have passed [9].
Singlepoint crossover operator
Mutation operator
Genetic algorithms in lens system design
First studies of GA in lens design
In 1990, research into the application of EAs for the monochromatic quartet was proposed at the International Lens Design Conference, now IODC [40]. Constraints of the fourelement lens design included only spherical surfaces, gradientindex (GRIN) optics elements, and Fresnel lenses.
Betensky successfully applied a GA to a Gaussian optics system design to correct aberrations, but mainly astigmatism. This algorithm was set with almost zero power operators including optimized structural changes in order to develop a lens system. To apply a GA to the zoom lens, problem is arduous due to the complex requirements for each operator [41]. A few years later, van Leijenhorst et al. investigated the GA as a tool for the automatic optimization and design of an optical lens system. Results showed fast and simultaneous corrected aberrations, even on less powerful computers. Further, they said it was possible that optical industries could use the GA for larger and more sophisticated optical systems [42].
Chen and Yamamoto applied a GA and a combined algorithm, including a GA and the DLS method, to lens design in order to correct lens aberrations and determine differences between these two methods. They found out that the GA is a useful algorithm for the global search and a beneficial starting point to perform the DLS method. Moreover, with the GA it is possible to avoid the local minima in gradientbased algorithms because the GA is based on a merit function of a population [26].
In the 2000s, Ono et al. [43] proposed a new lens optimization method by including realcoded GAs to small and largescale problems. They applied their technique successfully for global and multiobjective optimization. It worked very effective in finding good lens designs for both small and largescale problems. It was possible to analyze the lens design problem by optimizing a single criterion and with the two criteria such as distortion and resolution. The proposed GA utilizes unimodal normal distribution crossover (UNDX) and minimal generation gap (MGG) for an optimal lens design.
In terms of practical use, the proposed GA by Ono et al. could not be applied for several reasons. By changing the thickness and curvature, the GAs are not able to improve chromatic aberration. Due to this disadvantage, the algorithms are restricted to a single wavelength when designing optical systems such as IR cameras. Furthermore, the proposed GAs are not included in commercial CAD programs, which are essential for lens designers to use and do not provide an user interface that is easy to handle. A newer study by Fontana et al. [44] showed the possible implementation of a GA into a CAD tool they had developed for optimization and design.
Banerjee and Hazra studied the application of a GA on a structural lens design. They effectively accomplished the search for a global solution within utilitarian local optima. It is not possible to ascertain all values for the various parameters in a GA all at once. Alterations can probably affect the efficiency of the GA. The results could be used to improve the GA for optimization problems in reallife lens design [45].
Gagné et al. [46] applied EAs to an optimization criterion with complex mechanical constraints. Their results showed that EAs are comparable to those obtained by humans.
Thibault et al. from the Gagnés research group [46] discovered that on a reallife imaging problem the EA lens showed better results by a factor of almost two and was four times more sensitive than the expert lens design for the 1990 monochromatic quartet [40]. Moreover, an EA can explore a lens system, which is similar to a design performed by experts. Thibault et al. [1] did not incorporate sensitivity with regard to lens bending and lens shape.
Cuevas et al. applied the GA to solve the closedfringe demodulation problem in 2006. The population of chromosomes in a GA is linked to the coefficients of polynomials to calculate the local phase of an interferogram window. Specifically, they used the multipolynomial fitting (MPF) because the phase field is estimated and interpolated to any resolution size to assess the polynomial coefficients. In a second application, a GA was used on the nesting problem of finite materials. The nesting problem is based on the optimization of items which are nested in a valid place with the least wasted material [36].
Chen et al. used the GA in order to optimize Fresnel lenses which were inserted in lightemitting diode (LED) sources. It is not feasible to guarantee sufficient flux with a single LED, but with numerous LEDs it is possible. Chen et al. proposed an optimal design of a Fresnel lens with several LEDs to provide white light. The GA, including a fitness function with the appropriate illuminance and uniformity, was employed to search for the optimal groove angles of the Fresnel lens. They figured out that the generated optimal Fresnel lens showed more of an augmented light guidance than with typical Fresnel lenses for a multipleLED reading light system. The problem is the intrinsically restricted execution speed while performing the nonimaging optical tool for the optimal design procedure because it is not designed to create an optimal design with more numbers of source light rays [47].
Similar results were achieved by Chen and Uang [48] with their hierarchical GA (HGA) in order to optimize a largescale Fresnel lens for a multipleLED reading light system.
Chen et al. [50] suggested another method to optimize the optical LED design. Taguchi method [49] is wellfunctioning in the discontinuous region but poor for the use of an optimal optical design because of immoderate time consumption during the analyses. Angle and average illuminance were observed and indicated that the evolved system is applicable to the optical design of different LED lenses [50].
Fang et al. used a GA to effectively eliminate both axial and lateral chromatic aberrations of two Gausstype lens designs and to find the appropriate glass combination of two different Gausstype lenses. These two Gauss lens designs can remove primary chromatic aberrations. A telephoto lens design was used due to its sensitivity to axial aberration; in addition, a wideangle Gauss design was used to deal with lateral chromatic aberrations. In comparison with the DLS method, the proposed method to search for a two lenstype combination was more successful [51].
The lens designer has to deal with obstacles such as the variable nature of chromatic aberrations and influence. Fang et al. used the GA for lens design and optimization of the liquid lens element. The GA could be efficiently applied to replace the conventional least damping square (LDS) method to search for the optimal solution, including the chosen optical lens element, but also to quickly select the best glass combination. They achieved promising results in searching for the nest optical layout with liquid lenses and the best glass set to remove chromatic aberrations. This research took into account only the firstorder aberrations of thin lenses. Hence, the results were satisfactory [52].
Other research by Fang et al. was focused on a new digital zoom layout and optimization using an altered GA. They successfully developed an optical design and optimization of digital zoom optics which includes the liquid aspheric lens surface and improved significantly the performance of zoom optics. They noted that the MTF resembles the conventional DLS method in terms of approaching the optical diffraction limit [35].
State of the art technologies
Bajpai and Kumar [9] applied the GA to achieve global optimization by using the Rastrigin’s function [53]. They determined with the Rastrigin’s function many local minima function and only one global minimum. Further, they investigated the reasons why a GA is a good optimization tool. One of the main benefits is its intrinsic parallelity and therefore the ability to assess various schemas at once [9].
Furthermore, a hybrid GA is more effective and efficient than a traditional GA and is achieved if the GA includes other techniques in its framework. These kinds of algorithms are inserted to solve realworld problems rapidly, precisely, and reliably, without any manual help [9].
The application of hybrid GAs in lens system design was studied by several authors [10, 12, 54]. Fang et al. proposed a hybrid Taguchi GA to eliminate chromatic aberrations more effectively than with the conventional DLS method. This algorithm was applied to zoom optics with a diffractive optical element (DOE). Compared with the DLS method, they found that chromatic aberration for optical lenses could be significantly reduced with the hybrid technology [54]. Also, Tsai et al. [55] successfully applied the hybrid GA to zoom optics to specify the best position for DOE and to remove chromatic aberrations of the zoom optics with a DOE.
In 2015, Tsai et al. investigated the effect of a GA with DLS optimization on a projector lens to ameliorate the field curvature aberration (FCA) and image resolution. Often optical software is not able to simultaneously optimize the FCA and image resolution of lens design. The software works either for global or for local optimization and can only give out results of local optimization. The combination of a hybrid GA and DLS could be an optimal optimization approach for commercial software and has the capability to improve both image quality and various aberrations [12].
Yen and Jin applied efficiently a GA on aspherical lens design to reduce aberrations in multifocal artificial intraocular lenses (IOL) [10, 11]. They inserted a GA by mimicking the variation of thickness and curvature of the human eye into the optical software CODE V to create an IOL design. By comparing the builtin software algorithm with the GA, the suggested GA for IOL design showed more improvements of the spot size in root mean square (RMS), tangential coma (TCO), and the MTF.
Conclusion
In this paper, we have reviewed various results on the use of GAs in optical system design. A GA is applied to lens design to find the best global and stable solution within an optimization problem. Optimization is needed to improve the performance of a design. Compared to conventional optimization strategies (e.g., DLS), the GA is a powerful tool because it uses a coded parameter set, searches a population of points, and applies objective function information and probabilistic transition rules [56]. Specific studies have proven that GAs are perfect for finding the optimal groove angles of the Fresnel lens and are useful in finding the proper glass combination of two different Gausstype lens designs. Several cutting edge studies successfully show that a hybrid GA can be useful in lens design to correct and eliminate chromatic aberrations in the axial and lateral view. Fast and simultaneous corrections were applied to zoom optics with certain DOEs. The missing availability of the GA in commercial CAD programs has been resolved.
However, there still exist some limitations on the use of GAs. Limitations of GAs include time consumption for convergence which can be improved by a proper sized population and many generations. Trial and error is connected with the finetuning of all indispensable parameters for a GA. Defining the right definition of the MF for a GA is another crucial issue in lens design. Moreover, an inappropriate fitness function design may lead to unintelligible solutions. Having said this, there is considerable scope for further research and exploration of GAs in optical engineering.
Notes
Acknowledgements
Open access funding provided by TU Wien (TUW).
References
 1.S. Thibault, C. Gagné, J. Beaulieu et al., Evolutionary algorithms applied to lens design: case study and analysis, in Optical Design and Engineering II, vol. 5962 (SPIE the International Society for Optics and Photonics, 2005), p. 596209Google Scholar
 2.C.T. Reviews, Optometry, Science, Techniques and Clinical Management: Medicine, Ophthalmology, Cram101, 1 ed. (October 16, 2016)Google Scholar
 3.Edmundoptics, Introduction to modulation transfer function. https://www.edmundoptics.com/resources/applicationnotes/optics/introductiontomodulationtransferfunction/ (2018). Accessed 26 Apr 2018
 4.R.E. Fischer, B. TadicGaleb, P.R. Yoder et al., Optical System Design, 1st edn. (McGrawHill Professional, 2000)Google Scholar
 5.R.E. Fischer, T.G. Biljana, Y. Paul, Optical System Design 2nd edn. (McGrawHill Professional, 2008)Google Scholar
 6.A. Yabe, Optimization in Lens Design. https://doi.org/10.1117/3.2322375
 7.B. Brixner, Lens design and local minima. Appl. Opt. 20(3), 384–387 (1981)ADSGoogle Scholar
 8.Zemax, ZEMAX® optical design program user’s manual. https://neurophysics.ucsd.edu/Manuals/Zemax/ZemaxManual.pdf (July 8, 2011). Accessed 28 May 2018
 9.P. Bajpai, M. Kumar, Genetic algorithm—an approach to solve global optimization problems. Indian J. Comput. Sci. Eng. 1(3), 199–206 (2010)Google Scholar
 10.C.T. Yen, J.W. Ye, Aspherical lens design using hybrid neuralgenetic algorithm of contact lenses. Appl. Opt. 54(28), E88–E93 (2015)ADSGoogle Scholar
 11.C.T. Yen, S.C. Jin, Aspherical lens design using genetic algorithm for reducing aberrations in multifocal artificial intraocular lens. Materials 8(9), 6309–6325 (2015)ADSGoogle Scholar
 12.C.M. Tsai, Y.C. Fang, Improvement of filed curvature aberration in a projector lens by using hybrid genetic algorithm with damped least square optimization. J. Disp. Technol. 11(12), 1023–1030 (2015)ADSMathSciNetGoogle Scholar
 13.D. Sturlesi, D.C. O’Shea, Future of global optimization in optical design, in 1990 International Lens Design Conference, vol. 1354 (SPIE the International Society for Optics and Photonics, 1991), pp. 54–69Google Scholar
 14.G.W. Forbes, A.E. Jones, Towards global optimization with adaptive simulated annealing, in 1990 International Lens Design Conference, vol. 1354 (SPIE the International Society for Optics and Photonics, 1991), pp. 144–154Google Scholar
 15.G.K. Hearn, Practical use of generalized simulated annealing optimization on microcomputers, in 1990 International Lens Design Conference, vol. 1354 (SPIE the International Society for Optics and Photonics, 1991), pp. 186–192Google Scholar
 16.M. Isshiki, Global optimization with escape function, in SPIE the International Optical Design Conference 1998, vol. 3482 (SPIE the International Society for Optics and Photonics, 1998), pp. 104–110Google Scholar
 17.N. HesamMahmoudiNezhad, Optical System Optimization Using Genetic Algorithms, Master of Science Thesis (2014)Google Scholar
 18.I. The MathWorks, Global vs. local minima using GA. https://www.mathworks.com/help/gads/exampleglobalvslocalminimawithga.html (2018). Accessed 27 Apr 2018
 19.J. Pearce, J. G. Baker, Designer of highaltitude camera lenses, dies at 90. https://www.nytimes.com/2005/07/13/us/jgbakerdesignerofhighaltitudecameralensesdiesat90.html (2015). Accessed 30 June 2018
 20.D.P. Feder, Automatic optical design. Appl. Opt. 2(12), 1209–1226 (1963)ADSGoogle Scholar
 21.C. Wynne, P. Wormell, Lens design by computer. Appl. Opt. 2(12), 1233–1238 (1963)ADSGoogle Scholar
 22.D.S. Grey, The inclusion of tolerance sensitivities in the merit function for lens optimization, in ComputerAided Optical Design, vol. 147 (SPIE the International Society for Optics and Photonics, 1978), pp. 63–66Google Scholar
 23.S. Wright, J. Nocedal, Numerical optimization. Springer Sci. 35(67–68), 7 (1999)zbMATHGoogle Scholar
 24.O. Kramer, Machine Learning for Evolution Strategies, vol. 20 (Springer, Berlin, 2016)zbMATHGoogle Scholar
 25.G. Jones, Genetic and evolutionary algorithms. Encycl. Comput. Chem. 2, 1127–1136 (1998)Google Scholar
 26.X. Chen, K. Yamamoto, An experiment in genetic optimization in lens design. J. Mod. Opt. 44(9), 1693–1702 (1997)ADSGoogle Scholar
 27.W. Jakob, B. Knorr, S. Parodat et al., Optimierung von mikrosystemen. Methoden und Werkzeuge zum Entwurf von Mikrosystemen 8, 241–254 (1999)Google Scholar
 28.FrontlineSolvers®, Genetic algorithms and evolutionary algorithms—introduction. https://www.solver.com/geneticevolutionaryintroduction (2018). Accessed 28 May 2018
 29.D. Charles, On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life (John Murray, London, 1859)Google Scholar
 30.J.H. Holland, Adaptation in Natural and Artificial Systems. mi (University of Michigan Press, Ann Arbor, 1975)Google Scholar
 31.D.E. Goldberg, J.H. Holland, Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)Google Scholar
 32.I. Rechenberg, Evolutionsstrategie–optimierung technisher systeme nach prinzipien der biologischen evolution (FrommannHolzboog, University of Chicago, 1973)Google Scholar
 33.A.E.S. Auf, K. Lienemann, Genetische Algorithmen und Evolutionäre Strategien. https://www.techfak.unibielefeld.de/ags/wbski/lehre/digiSA/WS0304/IntAlg/Ausarbeitungen/GAES.pdf (2004). Accessed 23 May 2018
 34.D.A. Coley, An Introduction to Genetic Algorithms for Scientists and Engineers (World Scientific Publishing Company, Singapore, River Edge, NJ, 1999)Google Scholar
 35.Y.C. Fang, C.M. Tsai, C.L. Chung, A study of optical design and optimization of zoom optics with liquid lenses through modified genetic algorithm. Opt. Express 19(17), 16291–16302 (2011)ADSGoogle Scholar
 36.F. Cuevas, O. Gonzalez, Y. Susuki et al., Genetic algorithms applied to optics and engineering, in Fifth Symposium Optics in Industry, vol. 6046 (SPIE the International Society for Optics and Photonics, 2006), p. 60461KGoogle Scholar
 37.P.A. Whigham, G. Dick, J. Maclaurin, On the mapping of genotype to phenotype in evolutionary algorithms. Genet. Program. Evolvable Mach. 18(3), 353–361 (2017)Google Scholar
 38.C. Sheppard, Genetic algorithms with python. http://leanpub.com/genetic_algorithms_with_python (2016). Accessed 17 Mar 2018
 39.R. Parvez, Selection in evolutionary algorithm. https://www.slideshare.net/riyadparvez/selectioninevolutionaryalgorithm (2014). Accessed 10 May 2018
 40.D.C. O’shea, Monochromatic quartet: a search for the global optimum, in 1990 International Lens Design Conference, vol. 1354 (SPIE the International Society for Optics and Photonics, 1991), pp. 548–555Google Scholar
 41.E.I. Betensky, Postmodern lens design. Opt. Eng. 32(8), 1750–1757 (1993)ADSGoogle Scholar
 42.D.C. Van Leijenhorst, C.B. Lucasius, J.M. Thijssen, Optical design with the aid of a genetic algorithm. BioSystems 37(3), 177–187 (1996)Google Scholar
 43.I. Ono, S. Kobayashi, K. Yoshida, Optimal lens design by realcoded genetic algorithms using UNDX. Comput. Methods Appl. Mech. Eng. 186(2–4), 483–497 (2000)ADSzbMATHGoogle Scholar
 44.M. Fontana, F. Costa, U. Sangiorgi et al., A computer aided design for optimization of optical networks, in Optical Network Design and Modeling, 2008. ONDM 2008. International Conference on (IEEE, 2008), pp. 1–6Google Scholar
 45.S. Banerjee, L. Hazra, Experiments with a genetic algorithm for structural design of cemented doublets with prespecified aberration targets. Appl. Opt. 40(34), 6265–6273 (2001)ADSGoogle Scholar
 46.C. Gagné, J. Beaulieu, M. Parizeau et al., Humancompetitive lens system design with evolution strategies. Appl. Soft Comput. 8(4), 1439–1452 (2008)Google Scholar
 47.W.G. Chen, C.M. Uang, Better reading light system with lightemitting diodes using optimized Fresnel lens. Opt. Eng. 45(6), 063001 (2006)ADSGoogle Scholar
 48.W.G. Chen, C.M. Uang, Hierarchicalgeneticalgorithmbased design of a large scale Fresnel lens for a reading light system with multiple led sources. Appl. Opt. 45(30), 7832–7840 (2006)ADSGoogle Scholar
 49.G. Taguchi, Taguchi Methods Research and Development, vol. 1 of Quality engineering series, (American Supplier Institute, University of California, 1992)Google Scholar
 50.W.C. Chen, K.P. Liu, B. Liu et al., Optimization of optical design for developing an LED lens module. Neural Comput. Appl. 22(3–4), 811–823 (2013)Google Scholar
 51.Y.C. Fang, C.M. Tsai, J. MacDonald et al., Eliminating chromatic aberration in gausstype lens design using a novel genetic algorithm. Appl. Opt. 46(13), 2401–2410 (2007)ADSGoogle Scholar
 52.Y.C. Fang, C.M. Tsai, Miniature lens design and optimization with liquid lens element via genetic algorithm. J. Opt. A Pure Appl. Opt. 10(7), 075304 (2008)ADSGoogle Scholar
 53.L. Rastrigin, Extremal control systems. Theoretical foundations of engineering cybernetics series (Nauka, Moscow, 1974)Google Scholar
 54.Y.C. Fang, T.K. Liu, C.M. Tsai et al., Extended optimization of chromatic aberrations via a hybrid Taguchigenetic algorithm for zoom optics with a diffractive optical element. J. Opt. A Pure Appl. Opt. 11(4), 045706 (2009)ADSGoogle Scholar
 55.C.M. Tsai, Y.C. Fang, H.C. Lin, Extended optimization for 350X zoom optics via hybrid Tagushi genetic algorithm, in Photonics, Devices, and Systems IV, vol. 7138 (SPIE the International Society for Optics and Photonics, 2008), p. 71381FGoogle Scholar
 56.D.E. Goldberg, Genetic algorithms in search optimization and machine learning. AI Mag. 12, 102–103 (1989)Google Scholar
 57.J. Holland, D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (AddisonWesley, Boston, 1989)Google Scholar
 58.R.J. Paul, T.S. Chanev, Simulation optimisation using a genetic algorithm. Simul. Pract. Theory 6(6), 601–611 (1998)zbMATHGoogle Scholar
 59.Y.W. Chen, Z. Nakao, K. Arakaki et al., Blind deconvolution based on genetic algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 80(12), 2603–2607 (1997)Google Scholar
 60.T. Kawaguchi, T. Baba, R.I. Nagata, 3D object recognition using a genetic algorithmbased search scheme. IEICE Trans. Inf. Syst. 80(11), 1064–1073 (1997)Google Scholar
 61.G. Yang, L. Reinstein, S. Pai et al., A new genetic algorithm technique in optimization of permanent 125i prostate implants. Med. Phys. 25(12), 2308–2315 (1998)Google Scholar
 62.D.L. Carroll, Chemical laser modeling with genetic algorithms. AIAA J. 34(2), 338–346 (1996)ADSGoogle Scholar
 63.D.L. Carroll, Genetic algorithms and optimizing chemical oxygeniodine lasers. Dev. Theor. Appl. Mech. 18(3), 411–424 (1996)Google Scholar
 64.Z. Michalewicz, Evolution strategies and other methods, in Genetic Algorithms + Data Structures = Evolution Programs (Springer, 1996), pp. 159–177Google Scholar
 65.H.P. Schwefel, Numerical Optimization of Computer Models (Wiley, Hoboken, 1981)zbMATHGoogle Scholar
 66.K. De Jong, Learning with genetic algorithms: an overview. Mach. Learn. 3(2–3), 121–138 (1988)Google Scholar
 67.K.A. De Jong, Genetic algorithms are not function optimizers, in Foundations of Genetic Algorithms, vol. 2 (Elsevier, 1993), pp. 5–17Google Scholar
 68.S. VázquezMontiel, A. CornejoRodríguez, Lens design using genetic algorithm in the stage of optimization, in 17th Congress of the International Commission for Optics: Optics for Science and New Technology, vol. 2778 (SPIE the International Society for Optics and Photonics, 1996), p. 27781CGoogle Scholar
 69.X. Chen, K. Yamamoto, Genetic algorithm and its application in lens design, in Current Developments in Optical Design and Engineering VI, vol. 2863 (SPIE the International Society for Optics and Photonics, 1996), pp. 216–222Google Scholar
 70.I. Ono, Y. Tatsuzawa, S. Kobayashi et al., Designing lens systems taking account of glass selection by realcoded genetic algorithms, in Systems, Man, and Cybernetics, 1999. IEEE SMC’99 Conference Proceedings. 1999 IEEE International Conference on, vol. 3 (IEEE, 1999), pp. 592–597Google Scholar
 71.J. Beaulieu, C. Gagneé, M. Parizeau, Lens system design and reengineering with evolutionary algorithms, in Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation (Morgan Kaufmann Publishers Inc., 2002), pp. 155–162Google Scholar
 72.S. Chatterjee, L. Hazra, Structural design of cemented triplets by genetic algorithm. Opt. Eng. 43(2), 432–441 (2004)ADSGoogle Scholar
 73.L. Sanchis, A. Håkansson, D. LópezZanón et al., Integrated optical devices design by genetic algorithm. Appl. Phys. Lett. 84(22), 4460–4462 (2004)ADSGoogle Scholar
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.