報(bào)告人：   Una Benlic 助理研究員，英國斯特林大學(xué)

講座時(shí)間：2015年05月08日上午10點(diǎn)

講座地點(diǎn)：kaiyun開云官方網(wǎng)站犀浦校區(qū)kaiyun開云官方網(wǎng)站會(huì)議室X2511

內(nèi)容簡介：局部擾動(dòng)算法是在經(jīng)典的迭代搜索方法的基礎(chǔ)上，引入局部擾動(dòng)機(jī)制的算法。該算法以局部搜索方法為基礎(chǔ)，通過對(duì)當(dāng)前搜索信息的反饋，設(shè)置相應(yīng)的擾動(dòng)步長，從而擴(kuò)展搜索空間的廣度。局部擾動(dòng)算法在求解一些經(jīng)典的NP-hard的組合優(yōu)化問題上，與當(dāng)前高效的元啟發(fā)式算法相比，具有很強(qiáng)的競爭力。該講座將展示局部擾動(dòng)算法如何高效求解機(jī)場登機(jī)門分配問題。

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.