Automated synthesis of a human-competitive solution to the challenge problem of the 2002 international optical design conference by means of genetic programming and a multi-dimensional mutation operation

  • Authors:
  • Lee W. Jones;Sameer H. Al-Sakran;John R. Koza

  • Affiliations:
  • Genetic Programming Inc., Mountain View, California;Genetic Programming Inc., Mountain View, California;Stanford University, Stanford, California

  • Venue:
  • Proceedings of the 8th annual conference on Genetic and evolutionary computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper has two aspects. First, it describes the use of genetic programming to automatically synthesize a solution to the challenge problem posed at an international competition held every four years in the field of optical design. In 2002, the competition at the International Optical Design Conference attracted 42 entries from 39 well-known optical designers, commercial consultants, and patent holders from many of the field's most prominent companies, universities, and research institutions. The 39 human contestants spent an average of 34.1 hours working on their entries. Virtually all entries were considered good solutions to the challenge problem. Genetic programming automatically synthesized a design "from scratch" - that is, without starting from a pre-existing human-created design and without pre-specifying the number of lenses, the physical layout of the lenses, or the numerical or non-numerical parameters of the lenses. The run of genetic programming did not employ any knowledge base of design techniques or principles from the field of optical design and did not entail any human intervention during the run. The genetically evolved optical lens system would have ranked in the middle (21st) if it had been entered into the 2002 competition and is therefore an instance of a "human-competitive" result produced by genetic programming. Second, this paper presents a mutation operation for numerical constants that is especially appropriate for problems in which the to-be-designed structure contains a large number of non-linearly interrelated numerical values and for problems in which the topology of the solution is to be automatically created.