![Iterated local search for the quadratic assignment problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PA/bigB000PAA48I.jpg)
Iterated local search for the quadratic assignment problem [An article from: European Journal of Operational Research]
Price not available for India
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
T. Stutzle
Publisher
Elsevier
ISBN / ASIN
B000PAA48I
ISBN-13
978B000PAA484
Marketplace
India 🇮🇳
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
