Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

In this paper we consider the search in large state spaces with high branching factors and an objective function to be maximized. Our method portfolio, which we refer to as heuristically guided swarm tree search, is randomized, as it consists of several Monte-Carlo runs, and guided, as it relies on fitness selection. We apply different search enhancement such as UCT, look-aheads, multiple runs,...

We here propose an efficient tabu search (TS) for solving the uncapacitated single allocation hub location problem. To decrease the computational time, in the proposed tabu search, some new tabu rules are considered. Also, to compute the changes in the objective function’s value in each move, some new results are given. The performance of the proposed tabu search is compared with a recently pro...

Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critic...

In this paper, we assess the sensitivity of reactive tabu search to its meta-parameters. With a thorough experimental analysis, based on the quadratic assignment and the maximum clique problem, we show that the performance of reactive tabu search is relatively insensitive to its meta-parameters. This is particularly evident when compared to the sensitivity of tabu search to its parameters: tabu...

This paper describes a tabu search heuristic with path relinking for the vehicle routing problem. Tabu search is a local search method that explores the solution space more thoroughly than other local search based methods by overcoming local optima. Path relinking is a method to integrate intensification and diversification in the search. It explores paths that connect previously found elite so...

This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-speci®c and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspir...

A large number of heuristic search algorithms are available for function optimization. Each of these heuristics, e.g., simulated annealing, genetic algorithms, tabu search, etc., has been shown to be effective at finding good solutions efficiently. However, little work has been directed at determining what are the important problem characteristics for which one algorithm is more efficient than ...