Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 48, Issue 7, Pages 1947-1966Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540802603767
Keywords
warehousing; floor-storage systems; storage allocation; beam search; optimisation; integer programming problem
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available