Exact and inexact solution procedures for the order picking in an automated carousal conveyor

International Journal of Production Research

Volumn 46, Issue 16, 2008, Pages 4619-4636

  Lee, S D ^a   Kuo, Y C ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Carousal conveyor; Heuristics; Integer programming model; Multi travelling salesman problem; Order picking

Indexed keywords

CONVEYORS; DATA STORAGE EQUIPMENT; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING;

(E ,3E) PROCESS; (PL) PROPERTIES; 0-1 INTEGER PROGRAMMING; LOGISTIC SYSTEMS; MULTIPLE ITEMS; NUMERICAL EXPERIMENTS; ORDER PICKING; ORDER PROCESSING; PROBLEM SIZES; RETRIEVAL (MIR); SOLUTION PROCEDURES; TOTAL ORDER; TRAVELLING SALESMAN PROBLEM;

CUSTOMER SATISFACTION;

EID: 46649093407     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540601166990     Document Type: Article

References (18)

1. Bartholdi, J.J. and Platzman, L.K., Retrieval strategies for a carousel conveyor. IIE Trans., 1986, 18(2), 166-173.
2. Bland, R.G. and Shallcross, D.F., Large travelling salesman problems arising in X-ray crystallography: a preliminary report on computation. Op. Res. Letters, 1989, 9(3), 125-128.
3. Bozer, Y.A. and White, J.A., Travel-time models for automated storage/retrieval systems. IIE Trans., 1984, 16(4), 329-338.
4. Crowder, H. and Padberg, M.W., Solving large-scale symmetric travelling salesman problems to optimality. Manage. Sci., 1980, 26(5), 495-509.
5. Gibson, D.R. and Sharp, G.P., Order batching procedures. Euro. J. Op. Res., 1992, 58(1), 57-67.
6. Goetschalckx, M. and Ratliff, H.D., Order picking in an aisle. IIE Trans., 1988, 20(1), 53-62.
7. Jarvis, J.M. and McDowell, E.D., Optimal product layout in an order picking warehouse. IIE Trans., 1991, 23, 93-102.
8. Han, M.H., McGinnis, L.F., Shieh, J.S. and White, J.A., On sequencing retrievals in an automated storage/retrieval system. IIE Trans., 1987, 19, 56-66.
9. Hwang, H. and Lee, M.K., Order batching algorithms for a man-on-board automated storage and retrieval system. Eng. Costs & Prod. Econ., 1988, 13(4), 285-294.
10. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B. (Eds), The Travelling Salesman Problem, 1985 (John Wiley: New York).
11. Litvak, N. and Adan, I., The travel time in carousal systems under the nearest item heuristic. J. Appl. Prob., 2001, 38, 45-54.
12. Litvak, N. and Van Zwet, W.R., On the minimal travel time needed to collect n items on a circle. Ann. Appl. Prob., 2004, 14(2), 881-902.
13. McGinnis, L.F., Han, M.H. and White, J.A., Analysis of rotary rack operation. Mat. Flow, 1987, 4(4), 283-293.
14. Padberg, M. and Rinaldi, G., Optimisation of a 532-city symmetric travelling salesman problem by branch and cut. Op. Res. Letters, 1987, 6(1), 1-7.
15. Ratliff, H.D. and Rosenthal, A.S., Order-picking in a rectangular warehouse: a solvable case of the travelling salesman problem. Op. Res., 1983, 31(3), 507-521.
16. Rosenwein, M.B., A comparison of heuristics for the problem of batching orders for warehouse selection. Int. J. Prod. Res., 1996, 34(3), 657-664.
17. Rouwenhorst, B., Reuter, B., Stockrahm, V., Van Houtum, G.J., Mantel, R.J. and Zijm, W.H.M., Warehouse design and control: framework and literature review. Euro. J. Op. Res., 2000, 122(1), 515-533.
18. Van den Berg, J.P., Multiple order pick sequencing in a carousal system: a solvable case of the rural postman problem. J. Op. Res. Soc., 1996, 47(12), 1504-1515.