In this paper, a record-to-record travel (RRT) algorithm with an adaptive memory named taboo central memory (TCM) is adapted to solve the lexicographic goal programming problem. The proposed method can be applied to non-linear, linear, integer and combinatorial goal programmes. Because that the RRT has no memory, the adaptive memory TCM is inserted to diversify research. Computational experiments in several types of problems with different variable types (integer, continuous, zero-one and discrete) collected from the literature demonstrate that the proposed metaheuristic reaches high-quality solutions in short computational times. Furthermore, it requires very few user-defined parameters.
International Journal of Information and Decision Sciences – Inderscience Publishers
Published: Jan 1, 2010