A framework for accelerating metaheuristics via pattern reduction

Authors:
Chun-Wei Tsai;Shih-Pang Tseng;Ming-Chao Chiang;Chu-Sing Yang
Affiliations:
National Cheng Kung University, Tainan, Taiwan Roc;National Sun Yat-sen University, Kaohsiung, Taiwan Roc;National Sun Yat-sen University, Kaohsiung, Taiwan Roc;National Cheng Kung University, Tainan, Taiwan Roc
Venue:
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Year:
2010

Citing 4
Cited 1

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Ant Colony Optimization

Ant Colony Optimization

Continuous space pattern reduction for genetic clustering algorithm

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel framework based on the notion of pattern reduction, called Framework for Accelerating Metaheuristics via Pattern Reduction (FAMPR), to solve an intrinsic problem of metaheuristics. That is, many computations of metaheuristics during the convergence process are essentially redundant. As such, if they can be eliminated, the computation time of metaheuristics can be significantly reduced. Our experimental result shows that the proposed framework can significantly reduce the computation time of metaheuristics while limiting the loss of quality to a very small percentage.