Leveraging saving-based algorithms by master–slave genetic algorithms

Maria Battarra, Stefano Benedettini, Andrea Roli

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Saving-based algorithms are commonly used as inner mechanisms of efficient heuristic construction procedures. We present a general mechanism for enhancing the effectiveness of such heuristics based on a two-level genetic algorithm. The higher-level algorithm searches in the space of possible merge lists which are then used by the lower-level saving-based algorithm to build the solution. We describe the general framework and we illustrate its application to three hard combinatorial problems. Experimental results on three hard combinatorial optimization problems show that the approach is very effective and it enables considerable enhancement of the performance of saving-based algorithms.

Original languageEnglish
Pages (from-to)555-566
JournalEngineering Applications of Artificial Intelligence
Volume24
Issue number4
Early online date4 Mar 2011
DOIs
Publication statusPublished - Jun 2011

Fingerprint Dive into the research topics of 'Leveraging saving-based algorithms by master–slave genetic algorithms'. Together they form a unique fingerprint.

Cite this