Preview

warehouse design

Powerful Essays
Open Document
Open Document
5394 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
warehouse design
International Journal of Operations Research Vol. 1, No. 1, 37−46 (2004)

Optimal Storage Layout And Order Picking For Warehousing
Chiun-Ming Liu*
Department of Industrial Engineering and Systems Management, Feng Chia University, Taichung 407, Taiwan, R.O.C.

Abstract⎯In this paper, issues of storage layout and order picking operations problems for warehousing are addressed using optimization techniques. The aim of this study is to develop a dynamic planning system applied for storage layout and order-picking operations problems. The planning system considers dynamic nature of customer order demand, configuration of picking area, and interactive human-machine interface. Heuristic-based optimization technique is utilized to design the planning system. To analyze the dynamic nature of customer order demand, similarity measures among types of items are defined using the entry-order-quantity rule. Based on the characteristics of customer order demand and the configuration of picking area, a zero-one quadratic generalized assignment model is developed. A heuristic procedure is devised to find near-optimal solutions to this problem and coded using Borland C++ computer language. An industrial size application is performed to demonstrate this approach. Results indicate that the developed planning system can be promising for dealing with storage layout and order picking operations problems for warehousing.
Keywords⎯Warehousing, 0-1 quadratic generalized assignment model, stock location

1. INTRODUCTION
Logistics activities include order processing, storage layout, warehousing, inventory maintenance, transportation and material handling. These activities provide functions for bridging between producers of goods and market consumers, which are separated by time and distance. It has been estimated that logistics operations represent a large portion of a firm’s cost dollars. In many local distribution centers, items stored in the slots of racks are



References: 1. Ashayeri, J. and Gelders, L.F. (1985). Warehouse design optimization 2. Ballou, R.H. (1967). Improving the physical layout of merchandise in warehouses 3. Ballou, R.H. (1999). Business logistics management. 4th Edition, Prentice-Hall International Inc., Englewood 4. Dangelmaier, W. and Bachers, R. (1986). SIMULAP: a simulation system for material flow and warehouse 5. Davies, A.L., Gabbard, M.C., and Reinhold, E.F. (1983). 6. Dicht, E. and Beeskow, W. (1980). Optimal allocation of commodities in storehouse by means of 7. Francis, R.L., McGinis, L.F., and White, J.A. (1992). 8. Goetshalckx, M. and Ratliff, H.D. (1990). Shared storage policies based on the duration of stay. 9. Harmatuck, D.J. (1976). A comparison for two approaches to stock location 10. Heskeet, J.L. (1963). Cubic-per-order index: a key to warehouse stock location 11. Jarvis, J.M. and McDowell, E.D. (1991). Optimal product layout in an order picking warehouse 12. Joseph, B., Roll, Y., and Rosenblatt, M.J. (1980). 13. Kaku, B.K. and Thompson, G.L. (1991). An exact algorithm for the general quadratic assignment problem. 14. Kallina, C. and Lynn, J. (1976). Application of the cube-per-order index rule for stock location in a 15. Malette, A.J. and Francis, R.L. (1972). A generalized assignment approach to optimal facility layout 16. Malmborg, C.J. and Deutsch, S.T. (1988). A stock location model for dual address order picking systems. 17. Malmborg, C.J. and Krishnakumar, B. (1987). On the optimality of the cube per order index for conventional 18. Liu, C.M. (1999). Clustering techniques for stock location and order-picking in a distribution center. 19. Padberg, M.W. and Rijal, M.P. (1996). Location, scheduling, design and integer programming 20. Robert, F., David, M.G., and Brian, W.K. (1997). 21. Rosenblatt, M.J. and Roll, Y. (1984). Warehouse design with storage policy considerations 22. Rosenwein, M.B. (1994). An application of cluster analysis to the problem of locating items within a 23. Wilson, H.G. (1977). Order quantity, product popularity, and the location of stock in the warehouse

You May Also Find These Documents Helpful

  • Good Essays

    Hiram Miller—a

    • 748 Words
    • 3 Pages

    Upon our current situation, size is one of the crucial parts to be improved with our warehouse. 80,000-square-foot and low ceilings are apparently insufficient for efficient 53-foot trailers to work and cannot provide enough space for docks so that they have to load and unload materials much timely and is not convenient for customers picking up their freights. Compared with popular warehouse layouts, the six-story layout is less efficient because it uses elevators and chutes conveying items between each floor and adds complexity to the overall process. The old building has not done yet, but it can barely keep good condition for work. The weak floors cannot burden the heavy equipments like fork lifters and the elevators are always out of work which exacerbates the inefficiency. Besides, with the low-tech equipments we have, warehouse cannot stock various kinds of items. For instance, if we have a modern-design warehouse system, we will have more abilities to store items which are fragile, flammable, short-shelf-life or easy to cracked. The working environment is also not up to expectation. Fallen paint peels make workers sick while they are working.…

    • 748 Words
    • 3 Pages
    Good Essays
  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Customers request items because they want them, and want to purchase them from a convenient location. By acknowledging the requests within a reasonable time frame (for…

    • 739 Words
    • 3 Pages
    Good Essays
  • Good Essays

    delivery. To this end, we design two basic algorithms and an advanced algorithm framework. Within this…

    • 8009 Words
    • 33 Pages
    Good Essays
  • Powerful Essays

    Food Booth

    • 866 Words
    • 4 Pages

    Please provide linear programming model, graphical solution, sensitivity report, and answers to questions A thru C. (Problem on page 2)…

    • 866 Words
    • 4 Pages
    Powerful Essays
  • Good Essays

    2. The transportation problem described above can be solved mathematically using a computer package. The solution to the problem using excel solver are given in the following table.…

    • 1284 Words
    • 6 Pages
    Good Essays
  • Powerful Essays

    Today's ASDA¡¯s warehouses function autonomously, but they must also learn to think universally. This can lead to the development of advanced systems built on the idea of distribution at an enterprise level, connecting multiple sites and supply chains together for a network-centric view. Storage is the core activity of warehousing and it identifies the location where the goods are deposited and held…

    • 3356 Words
    • 14 Pages
    Powerful Essays
  • Powerful Essays

    The aforementioned topics have been modelled to manipulate practical variables in order to achieve the recommended optimal design.…

    • 2213 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    In the catalog business, it is difficult to try to match demand and supply. About 6000 items appeared in each catalog. Demand at the item level is hard to predict because it is affected not only by competition, the economy, weather, but also by customer behavior. Basically, LL Bean people forecasted using rules of thumb. Product people with buyers for each demand center meet together and after discussion and arguments, they developed preliminary item forecast by book.…

    • 422 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Transshipment Models

    • 403 Words
    • 2 Pages

    The assignment model is for a specific form of transportation model in which all supply and demand values are…

    • 403 Words
    • 2 Pages
    Satisfactory Essays
  • Better Essays

    Kiva-Paper

    • 4549 Words
    • 19 Pages

    The Kiva system [9, 2] is a solution for automating pick, pack and ship orders…

    • 4549 Words
    • 19 Pages
    Better Essays
  • Better Essays

    Simplex Method

    • 1287 Words
    • 6 Pages

    This problem, as outlined above, is an example of a linear programming problem. Linear programming is part of the Optimization Techniques field of Mathematics, used for resource allocation and organization. With linear programming problems, one takes the inequalities that exist within a given situation and deduces a best case scenario under those particular conditions (Stapel, 2009). One particularly effective method of solving linear programming problems is the Simplex Method.…

    • 1287 Words
    • 6 Pages
    Better Essays
  • Powerful Essays

    References: Abdul Q.; Javaid, S. and Khalid, M. M. (2012) A New Method for Finding an Optimal…

    • 9885 Words
    • 40 Pages
    Powerful Essays
  • Better Essays

    Tora Software

    • 1258 Words
    • 6 Pages

    The above problem is solved using computer with the help of TORA. Open the TORA package and select LINEAR PROGRAMMING option. Then press Go to Input and enter the input data as given in the input screen shown below, in…

    • 1258 Words
    • 6 Pages
    Better Essays
  • Powerful Essays

    Quadratic Assignment Problem

    • 2678 Words
    • 11 Pages

    References: [1] L. M. Gambardella, E. D. Taillard, and M. Dorigo. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society, 50:167–176, 1999. [2] F. Glover. Tabu search: Part 1. ORSA Journal on Computing, 1:190–206, 1989. [3] F. Glover. Tabu search: Part 2. ORSA Journal on Computing, 1:4–32, 1990. [4] F. Glover and M. Laguna. Tabu Search. Kluwer, Dordrecht, 1997. [5] T. C. Koopmans and M. Beckmann. Assignment problems and the location of economics activities. Econometrica, 25:53–76, 1957. [6] A. Misevicius. A tabu search algorithm for the quadratic assignment problem. Computational Optimization andApplications, 30:95–111, 2005. [7] C. E. Nugent, T. E. Vollman, and J. Ruml. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research, 16:150–173, 1968. [8] S. Shani and T. Gonzalez. P-complete approximation problems. Journal of the Association for Computing Machinery, 23:555–565, 1976. [9] M. R. Wilhelm and T. L. Ward. Solving quadratic assignment problems by simulated annealing. IIE Transactions, 19(1):107–119, 1987.…

    • 2678 Words
    • 11 Pages
    Powerful Essays