发帖
雷达卡
摘要翻译：
本文提出了一种局部搜索方法来解决一般的时间表问题，并对2007年国际时间表竞赛(ITC2007)的竞赛赛道3进行了具体的实现。启发式搜索过程基于阈值接受来克服局部最优。提出并实现了一个随机邻域，从当前解中随机删除和重新分配事件。总体概念是从一系列实验中逐步获得的，我们在论文的每个（子）部分都进行了描述。结果，我们成功地推导出了一个潜在的候选解决方案，用于ITC 2007年第三轨道决赛。
---
英文标题：
《An application of the Threshold Accepting metaheuristic for curriculum
based course timetabling》
---
作者：
Martin Josef Geiger
---
最新提交年份：
2008
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Timetabling Competition 2007 (ITC 2007). The heuristic search procedure is based on Threshold Accepting to overcome local optima. A stochastic neighborhood is proposed and implemented, randomly removing and reassigning events from the current solution. The overall concept has been incrementally obtained from a series of experiments, which we describe in each (sub)section of the paper. In result, we successfully derived a potential candidate solution approach for the finals of track 3 of the ITC 2007.
---
PDF链接：
https://arxiv.org/pdf/0809.0757
京公网安备 11010802022788号
