A software framework for fast prototyping of meta-heuristics hybridization
Hybrids of meta-heuristics have been shown to be more effective and adaptable than their parents in solving combinatorial optimization problems. However, hybridized schemes are also more tedious to implement due to their increased complexity. We address this problem by proposing the meta-heuristics...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1290 http://dx.doi.org/10.1111/j.1475-3995.2007.00578.x |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-2289 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-22892011-01-03T05:09:24Z A software framework for fast prototyping of meta-heuristics hybridization LAU, Hoong Chuin Wan, W. C. Halim, S. Toh, K. Y. Hybrids of meta-heuristics have been shown to be more effective and adaptable than their parents in solving combinatorial optimization problems. However, hybridized schemes are also more tedious to implement due to their increased complexity. We address this problem by proposing the meta-heuristics development framework (MDF). In addition to being a framework that promotes software reuse to reduce developmental effort, the key strength of MDF lies in its ability to model meta-heuristics using a “request, sense and response” schema, which decomposes algorithms into a set of well-defined modules that can be flexibly assembled through a centralized controller. Under this scheme, hybrid schemes become an event-based search that can adaptively trigger a desired parent's behavior in response to search events. MDF can hence be used to design and implement a wide spectrum of hybrids with varying degrees of collaboration, thereby offering algorithm designers quick turnaround in designing and testing their meta-heuristics. Such technicality is illustrated in the paper through the construction of hybrid schemes using ant colony optimization and tabu search. 2007-03-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/1290 info:doi/10.1111/j.1475-3995.2007.00578.x http://dx.doi.org/10.1111/j.1475-3995.2007.00578.x Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Business Computer Sciences Operations Research, Systems Engineering and Industrial Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Business Computer Sciences Operations Research, Systems Engineering and Industrial Engineering |
spellingShingle |
Business Computer Sciences Operations Research, Systems Engineering and Industrial Engineering LAU, Hoong Chuin Wan, W. C. Halim, S. Toh, K. Y. A software framework for fast prototyping of meta-heuristics hybridization |
description |
Hybrids of meta-heuristics have been shown to be more effective and adaptable than their parents in solving combinatorial optimization problems. However, hybridized schemes are also more tedious to implement due to their increased complexity. We address this problem by proposing the meta-heuristics development framework (MDF). In addition to being a framework that promotes software reuse to reduce developmental effort, the key strength of MDF lies in its ability to model meta-heuristics using a “request, sense and response” schema, which decomposes algorithms into a set of well-defined modules that can be flexibly assembled through a centralized controller. Under this scheme, hybrid schemes become an event-based search that can adaptively trigger a desired parent's behavior in response to search events. MDF can hence be used to design and implement a wide spectrum of hybrids with varying degrees of collaboration, thereby offering algorithm designers quick turnaround in designing and testing their meta-heuristics. Such technicality is illustrated in the paper through the construction of hybrid schemes using ant colony optimization and tabu search. |
format |
text |
author |
LAU, Hoong Chuin Wan, W. C. Halim, S. Toh, K. Y. |
author_facet |
LAU, Hoong Chuin Wan, W. C. Halim, S. Toh, K. Y. |
author_sort |
LAU, Hoong Chuin |
title |
A software framework for fast prototyping of meta-heuristics hybridization |
title_short |
A software framework for fast prototyping of meta-heuristics hybridization |
title_full |
A software framework for fast prototyping of meta-heuristics hybridization |
title_fullStr |
A software framework for fast prototyping of meta-heuristics hybridization |
title_full_unstemmed |
A software framework for fast prototyping of meta-heuristics hybridization |
title_sort |
software framework for fast prototyping of meta-heuristics hybridization |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2007 |
url |
https://ink.library.smu.edu.sg/sis_research/1290 http://dx.doi.org/10.1111/j.1475-3995.2007.00578.x |
_version_ |
1770570939630616576 |