Abstract
This paper presents an optimisation model and its effective solution technique using beam search heuristic for floor-storage warehousing systems. For a floor-storage system, storage can be accessed from the top of stacks only. The objective is to minimise the number of re-handling operations by optimally determining the storage location and by grouping products for each customer that fit a given sequence for receiving and retrieving operations. An integer programming model is formulated and an approximate solution technique based on the beam search method is proposed to solve the problem by incorporating effective heuristics to reduce the search space using future receiving and retrieving requests. The effectiveness of the proposed method is demonstrated for industrial warehousing problems in a steel plant with 58 storage areas involving more than 3000 retrieving operations. The proposed solution method is shown to be more efficient than the traditional branch-and-bound method for solving integer programming problems.
Original language | English |
---|---|
Pages (from-to) | 1947-1966 |
Number of pages | 20 |
Journal | International Journal of Production Research |
Volume | 48 |
Issue number | 7 |
DOIs | |
Publication status | Published - Jan 2010 |
Externally published | Yes |
Keywords
- Beam search
- Floor-storage systems
- Integer programming problems
- Optimisation
- Storage allocation
- Warehousing
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering