TY - JOUR
T1 - Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints
AU - Zhang, G. Q.
AU - Lai, K. K.
PY - 2010/8
Y1 - 2010/8
N2 - A new multi-level warehouse layout problem, the multi-level warehouse layout problem with adjacency constraints (MLWLPAC), is investigated. The same item type is required to be located in adjacent cells, and horizontal and vertical unit travel costs are product dependent. An integer programming model is proposed to formulate the problem, which is NP hard. Along with a cube-per-order index policy based heuristic, the standard tabu search (TS), greedy TS, and dynamic neighbourhood based TS are presented to solve the problem. The computational results show that the proposed approaches can reduce the transportation cost significantly. © 2010 Taylor & Francis.
AB - A new multi-level warehouse layout problem, the multi-level warehouse layout problem with adjacency constraints (MLWLPAC), is investigated. The same item type is required to be located in adjacent cells, and horizontal and vertical unit travel costs are product dependent. An integer programming model is proposed to formulate the problem, which is NP hard. Along with a cube-per-order index policy based heuristic, the standard tabu search (TS), greedy TS, and dynamic neighbourhood based TS are presented to solve the problem. The computational results show that the proposed approaches can reduce the transportation cost significantly. © 2010 Taylor & Francis.
KW - adjacency constraints
KW - multi-level
KW - tabu search
KW - warehouse layout
UR - http://www.scopus.com/inward/record.url?scp=77954923597&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77954923597&origin=recordpage
U2 - 10.1080/03052150903456477
DO - 10.1080/03052150903456477
M3 - RGC 21 - Publication in refereed journal
SN - 0305-215X
VL - 42
SP - 775
EP - 790
JO - Engineering Optimization
JF - Engineering Optimization
IS - 8
ER -