[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 2014
Citations38571766
h-index97
i10-index74

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.

Search published articles


Showing 2 results for Meta-Heuristic Algorithm

Sheibani,
Volume 2, Issue 2 (6-2011)
Abstract

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.

  


Khalili, Tavakkoli-Moghaddam,
Volume 4, Issue 1 (5-2013)
Abstract

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evaluate a well-known algorithm based on electromagnetic science. The motivation behind our proposed meta-heuristic approach has arisen from the attraction-repulsion mechanism of electromagnetic theories in physics. In this basic idea, we desire to bring our search closer to a region with a superior objective function while going away from the region with the inferior objective function in order to move the solution gradually towards optimality. The algorithm is carefully evaluated for its performance against two existing algorithms using multi-objective performance measures and statistical tools. The results show that our proposed solution method outperforms the others.

  



Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.05 seconds with 30 queries by YEKTAWEB 3862