作者: Aida Kharrat , Souhail Dhouib , Habib Chabchoub
DOI: 10.1504/IJIDS.2010.031886
关键词: Mathematical optimization 、 Lexicographical order 、 Computer science 、 Goal programming 、 Integer (computer science) 、 Adaptive memory 、 Variable (computer science) 、 Metaheuristic
摘要: In this paper, a record-to-record travel (RRT) algorithm with an adaptive memory named taboo central (TCM) is adapted to solve the lexicographic goal programming problem. The proposed method can be applied non-linear, linear, integer and combinatorial programmes. Because that RRT has no memory, TCM inserted diversify research. Computational experiments in several types of problems different variable (integer, continuous, zero-one discrete) collected from literature demonstrate metaheuristic reaches high-quality solutions short computational times. Furthermore, it requires very few user-defined parameters.