Home > Research > Publications & Outputs > Two frameworks for cross-domain heuristic and p...

Associated organisational unit

Links

Text available via DOI:

View graph of relations

Two frameworks for cross-domain heuristic and parameter selection using harmony search

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Published

Standard

Two frameworks for cross-domain heuristic and parameter selection using harmony search. / Dempster, P.; Drake, J.H.
Harmony Search Algorithm: Proceedings of the 2nd International Conference on Harmony Search Algorithm (ICHSA2015). Springer, 2015. p. 83-94 ( Advances in Intelligent Systems and Computing; Vol. 382).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Harvard

Dempster, P & Drake, JH 2015, Two frameworks for cross-domain heuristic and parameter selection using harmony search. in Harmony Search Algorithm: Proceedings of the 2nd International Conference on Harmony Search Algorithm (ICHSA2015). Advances in Intelligent Systems and Computing, vol. 382, Springer, pp. 83-94. https://doi.org/10.1007/978-3-662-47926-1_10

APA

Dempster, P., & Drake, J. H. (2015). Two frameworks for cross-domain heuristic and parameter selection using harmony search. In Harmony Search Algorithm: Proceedings of the 2nd International Conference on Harmony Search Algorithm (ICHSA2015) (pp. 83-94). ( Advances in Intelligent Systems and Computing; Vol. 382). Springer. https://doi.org/10.1007/978-3-662-47926-1_10

Vancouver

Dempster P, Drake JH. Two frameworks for cross-domain heuristic and parameter selection using harmony search. In Harmony Search Algorithm: Proceedings of the 2nd International Conference on Harmony Search Algorithm (ICHSA2015). Springer. 2015. p. 83-94. ( Advances in Intelligent Systems and Computing). Epub 2015 Aug 9. doi: 10.1007/978-3-662-47926-1_10

Author

Dempster, P. ; Drake, J.H. / Two frameworks for cross-domain heuristic and parameter selection using harmony search. Harmony Search Algorithm: Proceedings of the 2nd International Conference on Harmony Search Algorithm (ICHSA2015). Springer, 2015. pp. 83-94 ( Advances in Intelligent Systems and Computing).

Bibtex

@inbook{aa1e46c80d644ef7a50d95715002eef3,
title = "Two frameworks for cross-domain heuristic and parameter selection using harmony search",
abstract = "Harmony Search is a metaheuristic technique for optimizing problems involving sets of continuous or discrete variables, inspired by musicians searching for harmony between instruments in a performance. Here we investigate two frameworks, using Harmony Search to select a mixture of continuous and discrete variables forming the components of a Memetic Algorithm for cross-domain heuristic search. The first is a single-point based framework which maintains a single solution, updating the harmony memory based on performance from a fixed starting position. The second is a population-based method which co-evolves a set of solutions to a problem alongside a set of harmony vectors. This work examines the behaviour of each framework over thirty problem instances taken from six different, real-world problem domains. The results suggest that population co-evolution performs better in a time-constrained scenario, however both approaches are ultimately constrained by the underlying metaphors.",
author = "P. Dempster and J.H. Drake",
year = "2015",
month = sep,
day = "30",
doi = "10.1007/978-3-662-47926-1_10",
language = "English",
isbn = "9783662479254",
series = " Advances in Intelligent Systems and Computing",
publisher = "Springer",
pages = "83--94",
booktitle = "Harmony Search Algorithm",

}

RIS

TY - CHAP

T1 - Two frameworks for cross-domain heuristic and parameter selection using harmony search

AU - Dempster, P.

AU - Drake, J.H.

PY - 2015/9/30

Y1 - 2015/9/30

N2 - Harmony Search is a metaheuristic technique for optimizing problems involving sets of continuous or discrete variables, inspired by musicians searching for harmony between instruments in a performance. Here we investigate two frameworks, using Harmony Search to select a mixture of continuous and discrete variables forming the components of a Memetic Algorithm for cross-domain heuristic search. The first is a single-point based framework which maintains a single solution, updating the harmony memory based on performance from a fixed starting position. The second is a population-based method which co-evolves a set of solutions to a problem alongside a set of harmony vectors. This work examines the behaviour of each framework over thirty problem instances taken from six different, real-world problem domains. The results suggest that population co-evolution performs better in a time-constrained scenario, however both approaches are ultimately constrained by the underlying metaphors.

AB - Harmony Search is a metaheuristic technique for optimizing problems involving sets of continuous or discrete variables, inspired by musicians searching for harmony between instruments in a performance. Here we investigate two frameworks, using Harmony Search to select a mixture of continuous and discrete variables forming the components of a Memetic Algorithm for cross-domain heuristic search. The first is a single-point based framework which maintains a single solution, updating the harmony memory based on performance from a fixed starting position. The second is a population-based method which co-evolves a set of solutions to a problem alongside a set of harmony vectors. This work examines the behaviour of each framework over thirty problem instances taken from six different, real-world problem domains. The results suggest that population co-evolution performs better in a time-constrained scenario, however both approaches are ultimately constrained by the underlying metaphors.

U2 - 10.1007/978-3-662-47926-1_10

DO - 10.1007/978-3-662-47926-1_10

M3 - Chapter

SN - 9783662479254

T3 - Advances in Intelligent Systems and Computing

SP - 83

EP - 94

BT - Harmony Search Algorithm

PB - Springer

ER -