首页> 外文会议>International Conference on Automated Planning and Scheduling(ICAPS 2006); 2006; >A Multi-start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling
【24h】

A Multi-start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling

机译:带有本地搜索方法的考试开始时间表的多起点超大型邻域搜索方法

获取原文
获取原文并翻译 | 示例

摘要

This paper investigates a hybridisation of the very large neighbourhood search approach with local search methods to address examination timetabling problems. In this paper, we describe a 2 phase approach. The first phase employs "multi start" to carry out search upon a very large neighbourhood of solutions using graph theoretical algorithms implemented on an improvement graph. The second phase makes further improvemehts by utilising a local search method. We present experimental results which show that this combined approach compares favourably with other algorithms on the standard benchmark problems.
机译:本文研究了非常大的邻域搜索方法与本地搜索方法的混合,以解决考试时间表问题。在本文中,我们描述了一种两阶段方法。第一阶段采用“多次开始”,使用在改进图上实现的图论算法对很大范围的解决方案进行搜索。第二阶段通过使用本地搜索方法进一步改进。我们提供的实验结果表明,该组合方法在标准基准问题上与其他算法相比具有优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号