Anzeige
Erschienen in:
2020 | OriginalPaper | Buchkapitel
Assessing Simulated Annealing with Variable Neighborhoods
verfasst von : Eduardo Lalla-Ruiz, Leonard Heilig, Stefan Voß
Erschienen in: Learning and Intelligent Optimization
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Simulated annealing (SA) is a well-known metaheuristic commonly used to solve a great variety of \(\mathcal {NP}\)-hard problems such as the quadratic assignment problem (QAP). As commonly known, the choice and size of neighborhoods can have a considerable impact on the performance of SA. In this work, we investigate and propose a SA variant that considers variable neighborhood structures driven by the state of the search. In the computational experiments, we assess the contribution of this SA variant in comparison with the state-of-the-art SA for the QAP applied to printed circuit boards and conclude that our approach is able to report better solutions by means of short computational times.