.png){kind=icon}
返回
Looking ahead with the pilot method
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-2060-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repeatedly a master solution is modified; each time in a minimal fashion to account for best choices, where choices are judged by means of a separate heuristic result, the pilot solution. The pilot method may be seen as a meta-heuristic enhancing the quality of (any) heuristic in a system for heuristic repetition. Experiments show that the pilot method as well as similar methods can behave quite competitively in comparison with well-known and accepted meta-heuristics. In this paper we review some less known results. As a higher time complexity is usually associated with repetition, we investigate a simple short-cut policy to reduce the running times, while retaining an enhanced solution quality. Furthermore, we report successful experiments that incorporate a distinguishing feature of the pilot method, which is the extension of neighborhoods into local search, creating tabu search hybrids.
Keyword:
meta-heuristics
pilot method
rollout method
combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
暂无机构信息
引用论文
Applications of modern heuristic search methods to pattern sequencing problems现代启发式搜索方法在模式排序问题中的应用
.png){kind=icon}
PREAI
分享收藏An ant colony optimization algorithm for the minimum weight vertex cover problem求解最小权顶点覆盖问题的蚁群优化算法
PREAI
分享收藏
查看更多内容