In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

The availability of low cost powerful parallel graphic cards has estimulated a trend to implement diverse algorithms on Graphic Processing Units (GPUs). In this paper we describe the design of a parallel Cellular Genetic Algorithm (cGA) on a GPU and then evaluate its performance. Beyond the existing works on masterslave for fitness evaluation, we here implement a cGA exploiting data and instruc...

As the popularity of Twitter continues to increase rapidly, it is extremely necessary to analyze the huge amount of data that Twitter users generate. A popular method of tweet analysis is clustering. Because most tweets are textual, this study focuses on clustering tweets based on their textual content similarity. This study presents tweet clustering using cellular genetic algorithm cGA. The re...

In this paper, we show how cellular structures can be combined with a multi-objective genetic algorithm (MOGA) for improving its search ability to find Pareto-optimal solutions of multi-objective optimization problems. We propose an assignment method of a different search direction to each cell for implementing a cellular MOGA. In our cellular MOGA, every individual in each population exists in...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

clustering is the process of dividing a set of input data into a number of subgroups. the members of each subgroup are similar to each other but different from members of other subgroups. the genetic algorithm has enjoyed many applications in clustering data. one of these applications is the clustering of images. the problem with the earlier methods used in clustering images was in selecting in...

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems and as a recently emerged field of study and practice, virtual cellular manufacturing (VCM) inherits the importance from CM. One type of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this research, a bi-objective ...