Conference Proceeding Article
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.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
28th Annual International Computer Software and Applications Conference (COMPSAC)
City or Country
LAU, Hoong Chuin; LIM, M. K.; Wan, W. C.; and Halim, S..
A Development Framework for Rapid Metaheuristics Hybridization. (2004). 28th Annual International Computer Software and Applications Conference (COMPSAC). 362-367. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1129