In this paper, we present a hybrid method combining Tabu Search (TS) optimization algorithm with the Very Fast Simulated Annealing (VFSA) procedure for the Job-shop Scheduling Problem (JSP). Tabu search algorithms are among the most effective approaches for solving the job shop scheduling problem which is one of the most difficult NP-complete problems. However, neighborhood structures and move ...

In this paper, we present a concept of a CPU kernel with hardware support for local-search based optimization algorithms like Simulated Annealing (SA) and Tabu-Search (TS). The special hardware modules are: (i) A linked-list memory representing the problem space. (ii) CPU instruction set extensions supporting fast moves within the neighborhood of a solution. (iii) Support for the generation of ...

This paper deals with generating of an optimized route for multiple Traveling Salesman Problems. We used a methodology of clustering the given cities depending upon the number of salesmen and each cluster is allotted to a salesman. “k-Means clustering” algorithm has been used for easy clustering of the cities. In this way the mTSP has been converted into TSP which is simple in computation compa...

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster 'capacity'). The objective is to minimize the total scatter of objects from the 'centre' of the cluster to which they have been allocated. A simple constructive heuristic, a R-i...

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

We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors This problem is isomorphic to a variant of the multiple bin packing problem We make use of a candidate list strategy that generates only a small subset of all possible moves and employ a dynamic tabu list for handling tabu restrictions We also introduce an in uential div...

We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors. This problem is isomorphic to a variant of the multiple bin packing problem. We make use of a candidate list strategy that generates only a small subset of all possible moves, and employ a dynamic tabu list for handling tabu restrictions. We also introduce an innuential...

When there is a perturbation in a carefully constructed aircraft schedule, e.g. an aircraft breakdown, it is important to minimize the negative consequences of this disturbance. Here, a tabu search and a simulated annealing approach to the flight perturbation problem are presented. The heuristics use a tree-search algorithm to find new schedules for the aircraft, and utilize a path relinking st...