Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints

Engineering Optimization

Volumn 42, Issue 8, 2010, Pages 775-790

  Zhang, G Q ^a   Lai, K K ^b  

^a UNIVERSITY OF WINDSOR   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

adjacency constraints; multi level; tabu search; warehouse layout

Indexed keywords

ADJACENCY CONSTRAINTS; COMPUTATIONAL RESULTS; INDEX POLICIES; INTEGER PROGRAMMING MODELS; MULTI-LEVEL; NEIGHBOURHOOD; NP-HARD; TRANSPORTATION COST; TRAVEL COSTS; WAREHOUSE LAYOUT;

COST REDUCTION; INTEGER PROGRAMMING; PROBLEM SOLVING; TRANSPORTATION; WAREHOUSES;

TABU SEARCH;

EID: 77954923597     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052150903456477     Document Type: Article

References (14)

1. Chiang,W.C. and Chi, C., 1998. Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation. European Journal of Operational Research, 106 (2-3), 457-488.
2. Cormier, G. and Gunn, E.A., 1992. A review of warehouse models. European Journal of Operational Research, 58 (1), 3-13.
3. Glover F. and Laguna M., 1997. Tabu search. Boston, MA: Kluwer Academic.
4. Gu, J., Goetschalckx, M. and McGinnis, L.F., 2007. Research on warehouse operation: a comprehensive review. European Journal of Operational Research, 177 (1), 1-21.
5. Heskett, J.L., 1963. Cube-per-order - a key to warehouse stock location. Transportation and Distribution Management, 3 (1), 27-31.
6. James, R.J.W. and Buchanan, J.T., 1998. Performance enhancements to tabu search for the early/tardy scheduling problem. European Journal of Operational Research, 106 (2-3), 254-265.
7. Lai, K.K., Xue, J. and Zhang G., 2002. A two-stage heuristic for a paper reel layout problem - a revised simulated annealing approach. International Journal Production Economics, 75 (3), 231-243.
8. Malmborg, C.J. and Krishnakumar B., 1989. Optimal storage assignment policies for Multiaddress warehousing systems. IEEE Transactions on Systems, Man and Cybernetics, 19 (2), 197-204.
9. Önüt, S., Tuzkaya, U.R. and Dögaç, B., 2008. A particle swarm optimization algorithm for the multi-level warehouse layout design problem. Computers and Industrial Engineering, 54 (4), 783-799.
10. Wilson, H.G., 1977. Order quantity, product popularity, and the location of stock in a warehouse. AIIE Transactions, 9 (3), 230-237.
11. Yang, L. and Feng,Y., 2006. Fuzzy multi-level warehouse layout problem: new model and algorithm. Journal of Systems Science and Systems Engineering, 15 (4), 493-503.
12. Zhang, G. and Lai, K.K., 2006. Combining path relinking and genetic algorithms for the multi-level warehouse layout problem. European Journal of Operational Research, 169 (2), 413-425.
13. Zhang G.Q., Xue, J. and Lai, K.K., 2000. An improved GA for layout problem with adjacent constraints. International Journal of Production Research, 38 (14), 3343-3356.
14. Zhang, G., Xue, J. and Lai, K.K., 2002. A class of genetic algorithms for multi-level warehouse layout problem. International Journal of Production Research, 40 (3), 731-744.