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

e-learning model is examined of three major dimensions. and each dimension has a range of indicators that is effective in optimization and modeling, in many optimization problems in the modeling, target function or constraints may change over time that as a result optimization of these problems can also be changed. if any of these undetermined events be considered in the optimization process, t...

pavement permanent deformations due to lack of shear strength in mixture are a major reason of rutting. any simple test to determine mixtures resistance to permanent deformation isn’t distinguished in the 1st level of superpave mix design method and prevalent methods for evaluating mixture rut resistance are expensive and time-consuming. two aggregate types, gradations, asphalt cements and fill...

this study emphasized the ability of genetic algorithm and cellular automate to simulate urban land use changes by integrating adaptive model. the most important part of modeling is to define transition rules.  in this research, a cellular automata model in dinamica ego software was used coupled with genetic algorithm. according to disability of the software for manipulating large number of var...