en پژوهشی Original <p><i>We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a 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 approach is very efficient. </i><i></i></p><p> <i> </i></p> Combinatorial optimization, Genetic algorithms, GRASPS, Meta-heuristics 63 71 http://iors.ir/journal/browse.php?a_code=A-10-230-2&slc_lang=en&sid=1 Sheibani 0003194753284600900 0003194753284600900 Yes