G2TT
来源类型Article
规范类型其他
Population migration: A meta-heuristics for stochastic approaches to constraint satisfaction problems.
Mizuno K; Nishihara S; Kanoh H; Kishi I
发表日期2001
出处Informatica 25 (3): 421-429.
出版年2001
语种英语
摘要A meta-heuristics for escaping from local optima to solve constraint satisfaction problems is proposed, which enables self-adaptive dynamic control of the temperature to adjust the locality of stochastic search. In our method, several groups with different temperatures are prepared. To each group the same number of candidate solutions are initially allotted. Then, the main process is repeated until the procedure comes to a certain convergence. The main process is composed of two phases: stochastic searching and population tuning. As for the latter phase, after evaluating the adaptation value of every group, migration of some number of candidate solutions in groups with lower values to groups with higher values are induced. Population migration is a kind ofparallel version of simulated annealing, where several temperatures are spatially distributed. Some experiments are performed to verify the efficiency of the method applied to constraint satisfaction problems. It is also demonstrated that population migration is exceptionally effective in the critical region where phase transitions occur.
主题Risk, Modeling and Society (RMS)
关键词constraint satisfaction, search algorithms, stochastic search, meta-heuristics
URLhttp://pure.iiasa.ac.at/id/eprint/6316/
来源智库International Institute for Applied Systems Analysis (Austria)
资源类型智库出版物
条目标识符http://119.78.100.153/handle/2XGU8XDN/127972
推荐引用方式
GB/T 7714
Mizuno K,Nishihara S,Kanoh H,et al. Population migration: A meta-heuristics for stochastic approaches to constraint satisfaction problems.. 2001.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Mizuno K]的文章
[Nishihara S]的文章
[Kanoh H]的文章
百度学术
百度学术中相似的文章
[Mizuno K]的文章
[Nishihara S]的文章
[Kanoh H]的文章
必应学术
必应学术中相似的文章
[Mizuno K]的文章
[Nishihara S]的文章
[Kanoh H]的文章
相关权益政策
暂无数据
收藏/分享

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。