Toward perpetually organized unit-load warehouses

被引:20
作者
Carlo, Hector J. [1 ]
Giraldo, German E. [2 ]
机构
[1] Univ Puerto Rico, Dept Ind Engn, Mayaguez, PR 00681 USA
[2] Colombian Sch Engn, Projects Unit, Bogota, Colombia
关键词
Warehouse; Storage location assignment; Optimization; Facilities planning and design; Facility logistics; STORAGE-RETRIEVAL SYSTEM; AUTOMATED STORAGE; ASSIGNMENT; PUZZLE;
D O I
10.1016/j.cie.2012.06.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Determining the optimal storage assignment for loads in a unit-load warehouse has been extensively addressed in the facility logistics literature. However, the process of implementing a particular storage assignment given the current assignment of loads has not received much attention. Typically, unit-load warehouses use downtime or overtime to remove loads from their current location and move them to the suggested location. This study presents Rearrange-While-Working (RWW) as a strategy to optimize the process of rearranging a warehouse while serving a list of move requests. This study examines three scenarios: (1) one empty location in the warehouse and the material handling equipment (MHE) is idle; (2) one empty location in the warehouse under the RWW strategy; and (3) when there are multiple empty locations in the warehouse under RWW. In the first scenario, the MHE can make any movement desired as it is idle. For the other two scenarios it is assumed that the MHE is not idle so loads can only be moved when requested to perform a move request. Due to the complexity of the problems, several heuristics are proposed. Experimental results indicate that the proposed heuristics perform satisfactorily in terms of solution quality and computational time. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1003 / 1012
页数:10
相关论文
共 21 条
[1]   A modern treatment of the 15 puzzle [J].
Archer, AF .
AMERICAN MATHEMATICAL MONTHLY, 1999, 106 (09) :793-799
[2]  
Baker JE, 1987, P 2 INT C GEN ALG, V206, P14, DOI DOI 10.1007/S10489-006-0018-Y
[3]  
Capps James A., 1995, United States Patent, Patent No. [US6397311E11, 6397311]
[4]   REARRANGEMENT OF ITEMS IN A WAREHOUSE [J].
CHRISTOFIDES, N ;
COLLOFF, I .
OPERATIONS RESEARCH, 1973, 21 (02) :577-589
[5]  
Drozdek A., 2005, Data structures and algorithms in C++, V3rd
[6]  
Giraldo G. E., 2011, THESIS U PUERTO RICO
[7]   SHARED STORAGE POLICIES BASED ON THE DURATION STAY OF UNIT LOADS [J].
GOETSCHALCKX, M ;
RATLIFF, HD .
MANAGEMENT SCIENCE, 1990, 36 (09) :1120-1132
[8]  
Goldberg DE., 1989, GENETIC ALGORITHMS S, V13
[9]   Research on warehouse operation: A comprehensive review [J].
Gu, Jinxiang ;
Goetschalckx, Marc ;
McGinnis, Leon F. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (01) :1-21
[10]   Puzzle-based storage systems [J].
Gue, Kevin R. ;
Kim, Byung Soo .
NAVAL RESEARCH LOGISTICS, 2007, 54 (05) :556-567