An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics

Maria Battarra, Temel Oncan, Kuban Altinel, Bruce Golden, Daniele Vigo, E. Phillips

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient.
Original languageEnglish
Pages (from-to)368-378
JournalJournal of the Operational Research Society
Volume63
Issue number3
Publication statusPublished - 2012

Fingerprint

Tuning
Genetic algorithms
Evolutionary
Heuristics
Enhancement
Metaheuristics
Grid
Genetic algorithm
Minimum spanning tree

Cite this

Battarra, M., Oncan, T., Altinel, K., Golden, B., Vigo, D., & Phillips, E. (2012). An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics. Journal of the Operational Research Society, 63(3), 368-378.

An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics. / Battarra, Maria; Oncan, Temel; Altinel, Kuban; Golden, Bruce; Vigo, Daniele; Phillips, E.

In: Journal of the Operational Research Society, Vol. 63, No. 3, 2012, p. 368-378.

Research output: Contribution to journalArticle

Battarra, M, Oncan, T, Altinel, K, Golden, B, Vigo, D & Phillips, E 2012, 'An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics', Journal of the Operational Research Society, vol. 63, no. 3, pp. 368-378.
Battarra, Maria ; Oncan, Temel ; Altinel, Kuban ; Golden, Bruce ; Vigo, Daniele ; Phillips, E. / An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics. In: Journal of the Operational Research Society. 2012 ; Vol. 63, No. 3. pp. 368-378.
@article{9ae234e35099439f9d39c729e5f5926b,
title = "An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics",
abstract = "Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient.",
author = "Maria Battarra and Temel Oncan and Kuban Altinel and Bruce Golden and Daniele Vigo and E. Phillips",
year = "2012",
language = "English",
volume = "63",
pages = "368--378",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan",
number = "3",

}

TY - JOUR

T1 - An Evolutionary Approach for Tuning Parametric Esau and Williams Heuristics

AU - Battarra, Maria

AU - Oncan, Temel

AU - Altinel, Kuban

AU - Golden, Bruce

AU - Vigo, Daniele

AU - Phillips, E.

PY - 2012

Y1 - 2012

N2 - Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient.

AB - Owing to its inherent difficulty, many heuristic solution methods have been proposed for the capacitated minimum spanning tree problem. On the basis of recent developments, it is clear that the best metaheuristic implementations outperform classical heuristics. Unfortunately, they require long computing times and may not be very easy to implement, which explains the popularity of the Esau and Williams heuristic in practice, and the motivation behind its enhancements. Some of these enhancements involve parameters and their accuracy becomes nearly competitive with the best metaheuristics when they are tuned properly, which is usually done using a grid search within given search intervals for the parameters. In this work, we propose a genetic algorithm parameter setting procedure. Computational results show that the new method is even more accurate than an enumerative approach, and much more efficient.

M3 - Article

VL - 63

SP - 368

EP - 378

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 3

ER -