[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Home::
Journal Information::
Articles archive::
Submission Instruction::
Registration::
Submit article::
Site Facilities::
Contact us::
::
Google Scholar

Citation Indices from GS

AllSince 2019
Citations85403575
h-index127
i10-index136

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Volume 2, Issue 2 (6-2011) ::
IJOR 2011, 2(2): 63-71 Back to browse issues page
A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
Sheibani
Abstract:   (44022 Views)

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.

  

Keywords: Combinatorial optimization, Genetic algorithms, GRASPS, Meta-heuristics
Full-Text [PDF 137 kb]   (32852 Downloads)    
Type of Study: Original |
Received: 2011/07/4 | Accepted: 2013/06/22 | Published: 2013/06/22
Add your comments about this article
Your username or Email:

CAPTCHA


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 2, Issue 2 (6-2011) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.1 seconds with 38 queries by YEKTAWEB 4645