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

Citation Indices from GS

AllSince 2015

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-Heuristics

Volume 2, Issue 2 (6-2011)

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.


Ms. Maryam Akbari-Jafarabadi, Prof. Reza Tavakkoli-Moghaddam, Mr. Mehdi Mahmoodjanloo, Mr. Yaser Rahimi,
Volume 6, Issue 2 (9-2015)

In general, any system may be at risk in a case of losing the critical facilities by natural disasters or terrorist attacks. This paper focuses on identifying the critical facilities and planning to reduce the effect of this event. A three-level model is suggested in the form of a defender-attacker-defender. It is assumed that the facilities are hierarchical and capable of nesting. Also, the attacker budget for the interdiction and defender budget for fortification is limited. At the first level, a defender locates facilities in order to enhance the system capability with the lowest possible cost and full covering customer demand before any interdiction. The worst-case scenario losses are modeled in the second-level. At the third level, a defender is responsible for satisfying the demand of all customers while minimizing the total transportation and outsourcing costs. We use two different approaches to solve this model. In the first approach, the third level of the presented model is coded in Gams software, its second level is solved by an explicit enumeration method, and the first level is solved by tabu search (TS). In the second approach the first level is solved by the bat algorithm (BA). Finally, the conclusion is provided.

Page 1 from 1     

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