An optimization algorithm for TSP-like problem in warehouse picking

Abstract

In order to solve the problem of the order picking optimization in warehouse line, this study puts forward the concept of class TSP (Travelling Salesman Problem) based on a model using graph theory knowledge modelling. With the aid of the thought of classical TSP, it puts forward three principles, based on a fixed starting point (not repeatable) integer programming model; The solution of the model is also based on a simple optimization algorithm (vertex translocation method) of the classical TSP, and the appropriate modification is made. For the problem of unfixed starting point, the global traversal algorithm is added. Through the reconstruction of the line sequence, a TSP-like problem is successfully transformed into a TSP, and a model is finally established, which is a prominent innovation point of this paper. The calculation method of adjacency matrix W is given in the postscript.