製品移動回数と向先集約度を考慮した倉庫配置計画問題に対するビーム探索法の効率化  [in Japanese] 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  [in Japanese]

Access this Article

Search this Article

Author(s)

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.

Journal

  • IEEJ Transactions on Electronics, Information and Systems

    IEEJ Transactions on Electronics, Information and Systems 124(4), 1029-1035, 2004-04-01

    The Institute of Electrical Engineers of Japan

References:  6

Cited by:  3

Codes

  • NII Article ID (NAID)
    10012703825
  • NII NACSIS-CAT ID (NCID)
    AN10065950
  • Text Lang
    JPN
  • Article Type
    Journal Article
  • ISSN
    03854221
  • NDL Article ID
    6909949
  • NDL Source Classification
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL Call No.
    Z16-795
  • Data Source
    CJP  CJPref  NDL  J-STAGE 
Page Top