Issue: 2003/Vol.13/No.4, Pages 167-183
SOLVING NP-HARD PROBLEMS BY USING FUZZY SETS-BASED HEURISTICS
José Luis Verdegay
, Edmundo Vergara-Moreno
Cite as: J. L. Verdegay, E. Vergara-Moreno. Solving NP-Hard problems by using fuzzy sets-based heuristics. Operations Research and Decisions 2003: 13(4), 167-183.
Abstract
The main aim of this paper is to show how fuzzy sets and systems can be used to produce optimization algorithms able of being applied in a variety of practical situations. Fuzzy sets-based heuristics for Linear Programming problems are considered. To show the practical realisations of the approach proposed a metaheuristic proving the efficiency of using fuzzy rules as termination criteria is shown. Then the Travelling Salesman Problem and the Knapsack Problem are assumed and solved by means of this metaheuristic giving rise in this way to new heuristic algorithms solving these problems. Finally, as an illustration, some practical results showing the outstanding potential of these algorithms are shown.
Keywords: fuzzy set, Travelling Salesman Problem, Knapsack Problem, linear programming
Received: Accepted: