Leveraging saving-based algorithms by master–slave genetic algorithms

Maria Battarra; Stefano Benedettini; Andrea  Roli

doi:10.1016/j.engappai.2011.01.007

Leveraging saving-based algorithms by master–slave genetic algorithms

Maria Battarra, Stefano Benedettini, Andrea Roli

Research output: Contribution to journal › Article

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.

Language	English
Pages	555-566
Journal	Engineering Applications of Artificial Intelligence
Volume	24
Issue number	4
Early online date	4 Mar 2011
DOIs	10.1016/j.engappai.2011.01.007
Status	Published - Jun 2011

Fingerprint

Genetic algorithms

Combinatorial optimization

Cite this

Battarra, M., Benedettini, S., & Roli, A. (2011). Leveraging saving-based algorithms by master–slave genetic algorithms. Engineering Applications of Artificial Intelligence, 24(4), 555-566. https://doi.org/10.1016/j.engappai.2011.01.007

Leveraging saving-based algorithms by master–slave genetic algorithms. / Battarra, Maria; Benedettini, Stefano; Roli, Andrea .

In: Engineering Applications of Artificial Intelligence, Vol. 24, No. 4, 06.2011, p. 555-566.

Research output: Contribution to journal › Article

Battarra, M, Benedettini, S & Roli, A 2011, 'Leveraging saving-based algorithms by master–slave genetic algorithms', Engineering Applications of Artificial Intelligence, vol. 24, no. 4, pp. 555-566. https://doi.org/10.1016/j.engappai.2011.01.007

Battarra M, Benedettini S, Roli A. Leveraging saving-based algorithms by master–slave genetic algorithms. Engineering Applications of Artificial Intelligence. 2011 Jun;24(4):555-566. https://doi.org/10.1016/j.engappai.2011.01.007

Battarra, Maria ; Benedettini, Stefano ; Roli, Andrea . / Leveraging saving-based algorithms by master–slave genetic algorithms. In: Engineering Applications of Artificial Intelligence. 2011 ; Vol. 24, No. 4. pp. 555-566.

@article{e65850b501324048b9c8624e6d168d43,

title = "Leveraging saving-based algorithms by master–slave genetic algorithms",

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.",

author = "Maria Battarra and Stefano Benedettini and Andrea Roli",

year = "2011",

month = "6",

doi = "10.1016/j.engappai.2011.01.007",

language = "English",

volume = "24",

pages = "555--566",

journal = "Engineering Applications of Artificial Intelligence",

issn = "0952-1976",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Leveraging saving-based algorithms by master–slave genetic algorithms

AU - Battarra, Maria

AU - Benedettini, Stefano

AU - Roli, Andrea

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

U2 - 10.1016/j.engappai.2011.01.007

DO - 10.1016/j.engappai.2011.01.007

M3 - Article

VL - 24

SP - 555

EP - 566

JO - Engineering Applications of Artificial Intelligence

T2 - Engineering Applications of Artificial Intelligence

JF - Engineering Applications of Artificial Intelligence

SN - 0952-1976

IS - 4

ER -

Access to Document

10.1016/j.engappai.2011.01.007