This project is joint work with Robert Guillette and Ward Heilman.

A well-known problem in warehouse management is the Warehouse Picking Problem (WPP), which has the goal of visiting each item in an order to be picked in the shortest possible path through a warehouse. The essence of the difficulty underlying this problem is the fact that the WPP is a variation of the Traveling Salesperson Problem, and thus is intractable for large pick sizes. In this talk we present software designed as a tablet-based application, under the aptly named title Wherehouse, in which we employ various heuristic algorithms to find reasonable solutions to the WPP. The talk will primarily address the mathematical ideas behind the Nearest Neighbor and the Branch and Bound algorithms, as well as aspects of their implementation. The talk is accessible to both mathematics and computer science undergraduate students.