Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Genetic algorithms and tabu search: hybrids for optimization
Computers and Operations Research - Special issue on genetic algorithms
Placement of network servers in a wide-area network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tabu Search
A note on the tool switching problem of a flexible machine
Computers and Industrial Engineering - Special issue: Sustainability and globalization: Selected papers from the 32 nd ICC&IE
A Memetic Algorithm for the Tool Switching Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A memetic cooperative optimization schema and its application to the tool switching problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
| Hi-index | 0.00 |
The tool switching problem consists of N jobs which must be processed on a single flexible machine. The machine contains a tool magazine which has a limited capacity of C slots. Each job requires a set of tools and the total number of tools, M, required to process all N jobs is greater than C. The problem is to find a job sequence and the tools to be loaded on the machine before each job in the sequence such that the total number of tool switches is minimized. A variety of tabu search algorithms for solving this problem are proposed. The algorithms are tested on some random test problems and are compared with the basic algorithm. Computational results show that the use of recency-based and frequency-based memory along with strategic oscillation produce the best results.