Monte-Carlo Tree Search (MCTS) has been applied successfully in many domains, including games. However, its performance is not uniform on all and it also depends how parameters that control the search are set. Parameter values optimal for a task might be sub-optimal another. In domain tackles games with different characteristics, like general game playing (GGP), selecting appropriate parameter ...

gravitational search algorithm (gsa) is one of the newest swarm based optimization algorithms, which has been inspired by the newtonian laws of gravity and motion. gsa has empirically shown to be an efficient and robust stochastic search algorithm. since introducing gsa a convergence analysis of this algorithm has not yet been developed. this paper introduces the first attempt to a formal conve...

The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...