报告人： Una Benlic 助理研究员，英国斯特林大学
讲座时间：2015年05月08日上午10点
讲座地点：87978797威尼斯老品牌犀浦校区87978797威尼斯老品牌会议室X2511
内容简介：局部扰动算法是在经典的迭代搜索方法的基础上，引入局部扰动机制的算法。该算法以局部搜索方法为基础，通过对当前搜索信息的反馈，设置相应的扰动步长，从而扩展搜索空间的广度。局部扰动算法在求解一些经典的NP-hard的组合优化问题上，与当前高效的元启发式算法相比，具有很强的竞争力。该讲座将展示局部扰动算法如何高效求解机场登机门分配问题。
Title: Breakout Local Search: Application to Gate Allocation Problem
Reporter: Una Benlic, University of Stirling
Abstract: Breakout Local Search (BLS) is a recent variant of Iterated Local Search with a particular emphasis on the importance of perturbation. It explores the search space by a joint use of a local search procedure (usually a simple descent/ascent algorithm) and a diversification mechanism which adaptively determines the number and type of perturbation moves by considering some information related to the search state. In spite of its conceptual simplicity, BLS often shows to be highly competitive with some well-established metaheuristics. Moreover, it is among the current state-of-art algorithms for several classic NP-hard combinatorial problems. This seminar presents an application of BLS to gate allocation, one of the most important and complex airport related problems.
