Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other cl...

Wireless Sensor Network WSN deployment is an active research area. Its goal to deploy sensors in certain environment efficiently optimize some evaluation measures. Meta heuristic searching optimization approaches have been proven be effective solving problem. They strong power exploring the solution space and converging toward theoptimal region. One key factor achieving more meta-heuristic sele...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

This paper presents cell formation (CF) problem in dynamic condition with multiple alternative process plans and a set of alternative routes for each of process plans. Previous models paid attention to just one of the terms of process plans and routes and also they have not reflected the notion of defect rate after operations. Therefore, this paper also addresses defect rate. The proposed model...