A Development Framework for Rapid Metaheuristics Hybridization

While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. Thi...

Full description

Saved in:
Bibliographic Details
Main Authors: LAU, Hoong Chuin, LIM, M. K., Wan, W. C., Halim, S.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2004
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1129
https://ink.library.smu.edu.sg/context/sis_research/article/2128/viewcontent/COMPSAC05_MDF.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary:While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed with minimal coding, which gives our proposed metaheuristics development framework its uniqueness. To illustrate the concept, we restrict to two popular metaheuristics ants colony optimization and tabu search, and demonstrate MDF through the implementation of various hybridized models to solve the traveling salesman problem.