Adaptive record-to-record travel method to solve lexicographic goal programming models

Aida Kharrat, Souhail Dhouib and Habib Chabchoub

International Journal of Information and Decision Sciences, 2010, vol. 2, issue 2, 147-169

Abstract: 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.

Keywords: LGP; lexicographic goal programming; TCM; taboo central memory; RRT; record-to-record travel; adaptive memory; metaheuristics. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=31886 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijidsc:v:2:y:2010:i:2:p:147-169

Access Statistics for this article

More articles in International Journal of Information and Decision Sciences from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().