کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483299 | 1446213 | 2006 | 21 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Iterated local search for the quadratic assignment problem Iterated local search for the quadratic assignment problem](/preview/png/483299.png)
Iterated local search (ILS) is a simple and powerful stochastic local search method. This article presents and analyzes the application of ILS to the quadratic assignment problem (QAP). We justify the potential usefulness of an ILS approach to this problem by an analysis of the QAP search space. However, an analysis of the run-time behavior of a basic ILS algorithm reveals a stagnation behavior which strongly compromises its performance. To avoid this stagnation behavior, we enhance the ILS algorithm using acceptance criteria that allow moves to worse local optima and we propose population-based ILS extensions. An experimental evaluation of the enhanced ILS algorithms shows their excellent performance when compared to other state-of-the-art algorithms for the QAP.
Journal: European Journal of Operational Research - Volume 174, Issue 3, 1 November 2006, Pages 1519–1539