Data processing: artificial intelligence – Machine learning – Genetic algorithm and genetic programming system
Reexamination Certificate
2005-02-22
2005-02-22
Starks, Jr., Wilbert L. (Department: 2121)
Data processing: artificial intelligence
Machine learning
Genetic algorithm and genetic programming system
C706S045000
Reexamination Certificate
active
06859796
ABSTRACT:
A method is disclosed for processing data to identify optimal solutions to a problem using a genetic algorithm. Multiple populations of data entries, referred to as solutions, are created and kept separate from each other. Solutions are rated based on their desirability. Solutions from one population are combined, or “cross-bred,” with solutions from another population to create offspring solutions. The offspring of the cross-over are associated with one of the parent populations and rated. The most desirable solutions within a population are selected from the parent and offspring solutions to form the next generation of solutions. The remaining solutions may be discarded from the population. The cross-over and selection steps may then be repeated using second-generation solutions to create a third generation. The method may be implemented, for example, to design the layout of a circuit board. Diversity of solutions is increased by keeping the populations separate but allowing cross-breeding.
REFERENCES:
patent: 4935877 (1990-06-01), Koza
patent: 4961152 (1990-10-01), Davis
patent: 5255345 (1993-10-01), Shaefer
patent: 5343554 (1994-08-01), Koza et al.
patent: 5581657 (1996-12-01), Lyon
patent: 5839120 (1998-11-01), Thearling
patent: 5970487 (1999-10-01), Shackleford et al.
patent: 6182057 (2001-01-01), Kikuchi et al.
patent: 6480832 (2002-11-01), Nakisa
patent: 20020062296 (2002-05-01), Nakisa
patent: 20020095393 (2002-07-01), McHaney
patent: 20030055614 (2003-03-01), Pelikan et al.
patent: 20030088458 (2003-05-01), Afeyan et al.
Anderson et al., “Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem”, ORSA Journal on Computing, 1994, vol. 6, pp 161-173.*
Shapcott, “Index Tracking: Genetic Algorithms for Investment Portfolio Selection”, NEC Research Index, Sep. 1992, Retrieved from the Internet: http://citeseer.nj.nec.com/shapcott92index.html.*
Allenson, “Genetic Algorithms with Gender for Multi-function Optimisation”, NEC Research Index, Sep. 1992, Retrieved from the Internet: http://citeseer.nj.nec.com/allenson92genetic.html.*
Muhlenbein, “Genetic Algorithms”, NEC Research Index, 1997, Retrieved from the Internet: http://citeseer,nj.nec.com/5844.htm.*
Hoffmeister et al., “Genetic Self-Learning”, Proceedings of the 1st European Conference on Artificial Life, 1992.*
Yang, “Line-breeding Schemes for Combinatorial Optimization”, Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Sep. 1998.*
Koza, “Genetically Breeding Populations of Computer Programs to Solve Problems in Artificial Intelligence”, Proceedings of the 2nd International Conference on Tools for Al, 1990.*
Venkateswaran et al., “Cooperative Genetic Algorithm for Optimization Problems in Distributed Computer Systems”, Technical Report TR-EECS-93-018, School of EECS, Washington State University, 1993.*
Chu et al., “The Effect of Population Structure on the Rate of Convergence of Genetic Algorithms”, Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993.*
Merkle et al., “Scalability of an MPI-Based Fast Messy Genetic Algorithm”, Proceedings of the 1998 ACM Symposium on Applied Computing, 1998.*
Eick et al., “Learning Bayesian Classification Rules Through Genetic Algorithms”, Proceedings of the 2ndInternational Conference on Information and Knowledge Management, 1993.*
Liang et al., “A Sparse Matrix Representation For Production Scheduling Using Genetic Algorithms”, Proceedings of the 1995 ACM Symposium on Applied Computing, 1995.*
Khuri et al., “The Zero/One Multiple Knapsack Problem and Genetic Algorithms”, Proceedings of the 1994 ACM Symposium on Appied Computing,1994.*
Koza et al., “Automatic Programming of Robots Using Genetic Programming”, Proceedings of the 10thNational Conference on Artificial Intelligence, 1992.
LandOfFree
Method of using multiple populations with cross-breeding in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of using multiple populations with cross-breeding in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of using multiple populations with cross-breeding in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3504137