A Fast Heuristic Approach for the Assignment and Sequencing Storage Location Problem Under a Two Level Storage Policy

We consider a storage allocation problem which combines storage location assignment with sequencing decisions about the assigned storage locations, and which originates from a real-world application context. We propose a very efficient successive constrained shortest path method, which outperforms a matheuristic approach recently proposed in the literature in terms of both the computational time required and regarding the quality of the solutions found.