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

This study was conducted to investigate the prediction of growth performance using linear regression and artificial neural network (ANN) in broiler chicken. Artificial neural networks (ANNs) are powerful tools for modeling systems in a wide range of applications. The ANN model with a back propagation algorithm successfully learned the relationship between the inputs of metabolizable energy (kca...

In this paper, q-Gaussian Radial Basis Functions are presented as an alternative to Gaussian Radial Basis Function. This model is based on q-Gaussian distribution, which parametrizes the Gaussian distribution by adding a new parameter q. The q-Gaussian Radial Basis Function allows different Radial Basis Functions to be represented by updating the new parameter q. For example, when the q-Gaussia...

The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. Such problems are closely related to the generation of self-avoiding paths. In this paper, we study a variant of the original Recoil Growth algorithm, where we constrain the generation of a new polymer to take place on a specif...

We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on a square lattice at zero temperature, in cotrast to the existing algorithms. More importantly, the IGW algorithm facilitates growing compact configurations ...

We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which ...

Like any other precipitation process, in supercritical water hydrothermal synthesis (SWHS), the need to improve product quality and minimize production cost requires understanding and optimization of Particle Size Distribution (PSD). In this work, using Population Balance Equation (PBE) containing nucleation and growth terms, the reactive precipitation of zirconia nanoparticles prepared by ...

In data mining, the association rules are used to find for the associations between the different items of the transactions database. As the data collected and stored, rules of value can be found through association rules, which can be applied to help managers execute marketing strategies and establish sound market frameworks. This paper aims to use Fuzzy Frequent Pattern growth (FFP-growth) to...