• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International workshop on heuristics >Looking Ahead with the Pilot Pilot Method
【24h】

Looking Ahead with the Pilot Pilot Method

机译：展望飞行员飞行员方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The pilot method as a meta-heuristic is a tempered greedy method aimed at avoiding the greedy trap greedy trap by looking ahead for each possible choice (memorizing best results). 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 system for heuristic repetition. As usually a higher time complexity is associated with repetition, we propose policies to reduce the running times, while retaining an enhanced solution quality. While the basic idea of the pilot method was developed to account for feasible solutions of enhanced quality on may also incorporate these ideas, e.g., into local search and tabu search hybrids. In this paper we briefly survey the pilot method and related ideas such as the rollout method and provide numerical results for some well-known combinatorial optimization problems. Experiments show that the pilot method can be competitive in a head to head comparison with well-known and accepted meta-heuristics.
机译：作为元启发式的试验方法是一种旨在通过展望每种可能选择的贪婪陷阱贪婪陷阱的钢化贪婪方法（记忆最佳效果）。重复修改主解决方案;每次以最小的方式解释为最佳选择，那里可以通过单独的启发式结果来判断选项，试点解决方案。导频方法可以被视为启发式重复的系统。通常，通常复杂性与重复相关，我们提出了减少运行时间的策略，同时保留增强的解决方案质量。虽然开发了导频方法的基本思想，但是对于增强质量的可行解决方案，也可以将这些想法纳入其中，例如，进入本地搜索和禁忌搜索混合动力。在本文中，我们简要介绍了导频方法和相关思路，如卷展法，为某些众所周知的组合优化问题提供数值效果。实验表明，试点方法可以与众所周知和接受的元启发式竞争对手的头部比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号