An improvement of a beam search method for warehouse storage allocation planning problems minimizing the number of operations and the aggregated number of products for each customer

Tatsushi Nishi, Masami Konishi, Shinichiro Yamamoto

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The storage allocation planning problem in warehouse management is to determine the allocation of products to the storage space and intermediate operations for retrieving products so as to minimize the number of operations, and maximize the collected number of products for each customer when the sequence of requests for inlet and retrieval operations are given. In this paper, we propose an efficient beam search method for generating a near optimal solution with a reasonable computation time. A heuristic procedure is also proposed in order to reduce a search space in the beam search method by using the information of subsequent inlet and retrieving requests. The validity of the proposed method is confirmed by comparing the results with the optimal solution derived by solving an MILP problem. The effectiveness of the proposed method is demonstrated by solving an actual large-sized problem consisting of more than 3000 operations.

Original languageEnglish
Pages (from-to)1029-1035
Number of pages7
JournalIEEJ Transactions on Electronics, Information and Systems
Volume124
Issue number4
DOIs
Publication statusPublished - Jan 2004

Keywords

  • beam search
  • heuristic function
  • mixed integer linear programming problem
  • optimization
  • storage allocation problem
  • warehouse management

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An improvement of a beam search method for warehouse storage allocation planning problems minimizing the number of operations and the aggregated number of products for each customer'. Together they form a unique fingerprint.

Cite this