By Topic

A genetic algorithm for searching spatial configurations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Searching spatial configurations is a particular case of maximal constraint satisfaction problems, where constraints expressed by spatial and nonspatial properties guide the search process. In the spatial domain, binary spatial relations are typically used for specifying constraints while searching spatial configurations. Searching configurations is particularly intractable when configurations are derived from a combination of objects, which involves a hard combinatorial problem. This paper presents a genetic algorithm (GA) that combines a direct and an indirect approach to treating binary constraints in genetic operators. A new genetic operator combines randomness and heuristics for guiding the reproduction of new individuals in a population. Individuals are composed of spatial objects whose relationships are indexed by a content measure. This paper describes the GA and presents experimental results that compare the genetic versus a deterministic and a local-search algorithm. These experiments show the convenience of using a GA when the complexity of the queries and databases do no guarantee the tractability of a deterministic strategy.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:9 ,  Issue: 3 )