Adaptive record-to-record travel method to solve lexicographic goal programming models
by Aida Kharrat, Souhail Dhouib, Habib Chabchoub
International Journal of Information and Decision Sciences (IJIDS), Vol. 2, No. 2, 2010

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.

Online publication date: Sat, 27-Feb-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com