Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Adaptive record-to-record travel method to solve lexicographic goal programming models 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Information and Decision Sciences Inderscience Publishers

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

Loading next page...
 
/lp/inderscience-publishers/adaptive-record-to-record-travel-method-to-solve-lexicographic-goal-bzE50rJJAa
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1756-7017
eISSN
1756-7025
DOI
10.1504/IJIDS.2010.031886
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Information and Decision SciencesInderscience Publishers

Published: Jan 1, 2010

There are no references for this article.