In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

Slicing has been widely applied in many fields of software engineering, such as debugging, testing, software maintenance and restructuring. Several meta-heuristic search algorithms have been discussed and applied in many areas and been proved to work effectively. Hence, the concept of formulating slicing to search-based applications under the framework of SBSE is arose. This report introduces a...

Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...

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

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

This paper proposes a novel hybrid t-way test generation strategy (where t indicates interaction strength), called High Level Hyper-Heuristic (HHH). HHH adopts Tabu Search as its high level meta-heuristic and leverages on the strength of four low level meta-heuristics, comprising of Teaching Learning based Optimization, Global Neighborhood Algorithm, Particle Swarm Optimization, and Cuckoo Sear...

abstract— in this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. in this method, we have tried to change the main equation of searching within the original abc algorithm. on this basis, a new combined equation was used for steps of employed bees and onlooker bees. for this...