Comparing genetic algorithms and tabu search in the order batch picking problem

University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

Author: Jonas Valfridsson; Johan Vikström; [2019]

Keywords: ;

Abstract: In this paper genetic algorithms (GA) and tabu search are compared in the order batch picking problem – modelled as a multiple agent traveling salesman problem. The algorithms are evaluated in a simulated warehouse implemented with class based storage in mind. Both of the approaches appeared to find optimal solutions where it was possible to verify but it was was hard to comment on optimality as the problem space grew. In the implementations in this paper it was possible to construct a heuristic for the tabu search to outperform the GA. However in their general forms the GA outperformed the tabu search in the experiments

  AT THIS PAGE YOU CAN DOWNLOAD THE WHOLE ESSAY. (follow the link to the next page)