.png){kind=icon}
返回
A genetic algorithm for searching spatial configurations
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2005.844157.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
constraint satisfaction problems (CSPs)
evolutionary computation
genetic algorithm (GA)
geographic information systems
information retrieval
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Longitudinal transcriptome analyses show robust T cell immunity during recovery from COVID-19纵向转录组分析显示新型冠状病毒肺炎恢复过程中T细胞免疫功能强大
OAAI
OAAI分享收藏分享收藏
查看更多内容