Skip to main content


The Traveling Salesman Problem (TSP) calculates the best order of the nodes that should be visited in a graph to reduce the total traveling time or distance. In this concept, the corresponding node to each slot (which itself was selected based on the SKU that the picker wanted to pick) will play the node in the graph role and the picker will be the traveling salesman. Utilizing such algorithms can benefit us in achieving the best (or in some cases close-to-best) path the picker should take. The following are the functions that can be used to achieve this goal in the current version of the package.