The fuzzy greedy search in combinatorial optimization with specific reference to the travelling salesman problem

This paper describes a hybrid meta-heuristic for combinatorial optimization problems with specific reference to the travelling salesman problem (TSP). The method is a combination of genetic algorithms (GA) and greedy randomized adaptive search procedures (GRASP). A new adaptive fuzzy greedy search operator is developed for this hybrid method. Computational experiments using a wide range of standard benchmark problems indicate that the proposed hybrid meta-heuristic is very efficient.