The optimization of number of kanbans with genetic algorithms, simulated annealing and tabu search

In this paper, three simulation search heuristic procedures, based on genetic algorithms, simulated annealing and tabu search, respectively, were developed and compared (both with respect to the best results achieved by each algorithm in a limited time span and to their speed of convergence) to the results for finding the optimum number of kanbans while minimizing the cost in a just-in-time manufacturing system.