Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Combining constructive and equational geometric constraint-solving techniques
ACM Transactions on Graphics (TOG)
Intelligence through simulated evolution: forty years of evolutionary programming
Intelligence through simulated evolution: forty years of evolutionary programming
Sketch-based pruning of a solution space within a formal geometric constraint solver
Artificial Intelligence
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
System Identification through Simulated Evolution: A Machine Learning Approach to Modeling
System Identification through Simulated Evolution: A Machine Learning Approach to Modeling
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
An Investigation of Niche and Species Formation in Genetic Function Optimization
Proceedings of the 3rd International Conference on Genetic Algorithms
Some Guidelines for Genetic Algorithms with Penalty Functions
Proceedings of the 3rd International Conference on Genetic Algorithms
GA-easy and GA-hard Constraint Satisfaction Problems
Constraint Processing, Selected Papers
Symbolic and numerical techniques for constraint solving
Symbolic and numerical techniques for constraint solving
A correct rule-based geometric constraint solver
Computers and Graphics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Automatic parameter tuning with a Bayesian case-based reasoning system. A case of study
Expert Systems with Applications: An International Journal
Meta heuristics for dependent portfolio selection problem considering risk
Expert Systems with Applications: An International Journal
Example-based procedural modelling by geometric constraint solving
Multimedia Tools and Applications
Hi-index | 0.00 |
Geometric problems defined by constraints have an exponential number of solution instances in the number of geometric elements involved. Generally, the user is only interested in one instance such that besides fulfilling the geometric constraints, exhibits some additional properties. Selecting a solution instance amounts to selecting a given root every time the geometric constraint solver needs to compute the zeros of a multi valuated function. The problem of selecting a given root is known as the Root Identification Problem.In this paper we present a new technique to solve the root identification problem. The technique is based on an automatic search in the space of solutions performed by a genetic algorithm. The user specifies the solution of interest by defining a set of additional constraints on the geometric elements which drive the search of the genetic algorithm. The method is extended with a sequential niche technique to compute multiple solutions. A number of case studies illustrate the performance of the method.