Skip to main content
SpringerLink
Log in

Design and Optimization of Picking in the Case of Multi-Item Multi-Location Multi-Pallet Customer Orders

  • Chapter
  • First Online:
Warehousing in the Global Supply Chain

Abstract

Order picking-related costs may account for up to 65% of the total expense of warehouse management. Hence, the implementation of robust design and optimization procedures for planning picking is addressed by researchers and practitioners. In this chapter the case of warehouses served by humans, in picker-to-parts systems, with a discrete picking organization is studied. Specifically, the case of orders including multiple different items, located in different aisles and requiring more than one forklift load to completely satisfy customer requests is analyzed, with the aim of minimizing the time for retrieving an order. Specifically, two aspects are studied: (1) the grouping of orders into a finite number of forklift missions, by assuring that each required item is picked in the required amount (2) the optimization of the routing to be followed by handling facilities in accordance with the objective of minimizing the total traveled distance and the computation of the number of handling facilities necessary for serving the warehouse aisles.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Alves C, de Carvalho JMV (2007) Accelerating column generation for variable sized bin-packing problems. Eur J Oper Res 183:1333–1352

    Article  MATH  Google Scholar 

  • Applegate D, Bixby RE, Chvátal V, Cook W (2007) The traveling salesman: a computational study. Princeton University Press, Princeton

    Google Scholar 

  • Baldacci R, Toth P, Vigo D (2007) Recent advances in vehicle routing exact algorithms. 4OR: Q J Oper Res 5:269–298

    Article  MATH  MathSciNet  Google Scholar 

  • Baldacci R, Toth P, Vigo D (2010) Exact algorithms for routing problems under vehicle capacity constraints. In: Bouyssou D, Martello S, Plastria F Operations research II, invited surveys from 4OR, 2006–2008. Ann Oper Res 175:213–245

    Article  MATH  MathSciNet  Google Scholar 

  • Bard JF, Jarrah AI (2009) Large-scale constrained clustering for rationalizing pickup and delivery operations. Transp Res B 43:542–561

    Article  Google Scholar 

  • Bischoff EE, Janetz F, Ratchliff MSW (1995) Loading pallets with non-identical items. Eur J Oper Res 84:681–692

    Article  MATH  Google Scholar 

  • Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case. 4OR: Q J Oper Res 1:27–42

    MATH  MathSciNet  Google Scholar 

  • Caprara A, Monaci M (2009) Bidimensional packing by bilinear programming. Math Program 118:75–108

    Article  MATH  MathSciNet  Google Scholar 

  • Carpaneto G, Dell’Amico M, Toth P (1995) Exact solution of large scale asymmetric travelling salesman problem. ACM Trans Math Softw 21:394–409

    Article  MATH  MathSciNet  Google Scholar 

  • Climer S, Zhang W (2006) Cut and solve: an iterative search strategy for combinatorial optimization problems. Artif Intell 170:714–738

    Article  MATH  MathSciNet  Google Scholar 

  • Cordeau JF, Laporte G, Savelsbergh MWP, Vigo D (1999) Vehicle routing. In: Barnhart C, Laporte G (eds) Transportation. Handbooks in operations research and management science. Elsevier, Amsterdam

    Google Scholar 

  • Cordeau J-F, Gendreau M, Hertz A, Laporte G, Sormany J-S (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization. Springer, New York

    Google Scholar 

  • Coyle JJ, Bardi EJ, Langley CJ (1996) The management of business logistics. West Publihing Company, St.Paul

    Google Scholar 

  • Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J Comput 20:368–384

    Article  MathSciNet  Google Scholar 

  • D’Ambrosio C, Lodi A, Martello S (2010) Combinatorial traveling salesman problem algorithms. In: Cochran JJ (ed) Wiley encyclopedia of operations research and management science. Wiley, Chichester

    Google Scholar 

  • de Koster R, Van der Poort ES (1998) Routing order pickers in a warehouse: a comparison between optimal and heuristic solutions. IIE Trans 30:469–480

    Article  Google Scholar 

  • de Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182:481–501

    Article  MATH  Google Scholar 

  • Dekker R, de Koster R, Roodbergen KJ, van Kalleveen H (2004) Improving order-picking response time at Ankor’s warehouse. Interfaces 34:303–313

    Article  Google Scholar 

  • Duhamel C, Lacomme P, Quilliot A, Toussaint H (2011) A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput Oper Res 38:617–640

    Article  MATH  Google Scholar 

  • Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J Comput 15:267–283

    Article  MathSciNet  Google Scholar 

  • Fekete SP, Schepers J, van der Veen JC (2007) An exact algorithm for higher dimensional orthogonal packing. Oper Res 55:569–587

    Article  MATH  MathSciNet  Google Scholar 

  • Fuellerer G, Doerner K, Hartl R, Iori M (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput Oper Res 36:655–673

    Article  MATH  Google Scholar 

  • Fuellerer G, Doerner K, Hartl R, Iori M (2010) Metaheuristics for vehicle routing problems with three dimensional loading constraints. Eur J Oper Res 201:751–759

    Article  MATH  Google Scholar 

  • Gamberini R, Grassi A, Mora C, Rimini B (2005) Concurrent package and warehouse design in the case of random storage policy. In: 18th International Conference on Production Research, Fisciano, 31 Luglio–4 Agosto

    Google Scholar 

  • Gamberini R, Grassi A, Mora C, Rimini B (2008) An innovative approach for optimizing warehouse capacity utilization. Int J Logist: Res Appl 11:137–165

    Article  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2006) A tabu search algorithm for a routing and container loading problem. Trans Sci 40:342–350

    Article  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2007a) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 5:4–18

    MathSciNet  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2007b) Erratum: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51:153–153

    Article  MathSciNet  Google Scholar 

  • Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51:4–18

    Article  MATH  MathSciNet  Google Scholar 

  • Goetschalkx M, Ashayeri J (1989) Classification and design of order picking systems. Logist World June 673:99–106

    Google Scholar 

  • Golden B, Raghavan S, Wasil E (2008) The vehicle routing problem: latest advances and new challenges. Operations research/computer science interfaces series, vol 43. Springer, Berlin

    Google Scholar 

  • Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: a comprehensive review. Eur J Oper Res 177:1–21

    Article  MATH  Google Scholar 

  • Gutin G, Punnen AP (2002) The traveling salesman and its variations. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Hall RW (1993) Distance approximation for routing manual pickers in a warehouse. IIE Trans 25:76–87

    Article  Google Scholar 

  • Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18:4–27

    Article  MATH  MathSciNet  Google Scholar 

  • Iori M, Salazar González JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Trans Sci 41:253–264

    Article  Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345–358

    Article  MATH  Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1985) The travelling salesman problem. Wiley, Chichester

    Google Scholar 

  • Letchford AN, Lodi A (2010) Mathematical programming approaches to the traveling salesman problem. In: Cochran JJ (ed) Wiley encyclopedia of operations research and management science. Wiley, Chichester

    Google Scholar 

  • Makris PA, Giakoumakis IG (2003) k-Interchange heuristic as an optimization procedure for material handling applications. Appl Math Model 27:345–358

    Article  MATH  Google Scholar 

  • Manzini R, Gamberini R (2008) Design, management and control of logistic distribution systems. In: Kordic V (ed) Supply chain: theory and applications. I-Tech Education and Publishing, Vienna

    Google Scholar 

  • Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44:388–399

    Article  MATH  Google Scholar 

  • Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48:256–267

    Article  MATH  MathSciNet  Google Scholar 

  • Martello S, Pisinger D, Vigo D, den Boef E, Korst J (2007) Algorithm 864: general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans Math Softw 33:1–12

    Article  Google Scholar 

  • Petersen CG (1997) An evaluation of order picking routing policies. Int J Oper Prod Manag 17:1098–1111

    Article  Google Scholar 

  • Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19:36–51

    Article  MathSciNet  Google Scholar 

  • Ratliff HD, Rosenthal AS (1983) Order-picking in a rectangular warehouse: a solvable case of the travelling salesman problem. Oper Res 31:507–521

    Article  MATH  Google Scholar 

  • Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Lecture notes in computer science. Springer, Berlin

    Google Scholar 

  • Roodbergen KJ, de Koster R (2001a) Routing order-pickers in a warehouse with a middle aisle. Eur J Oper Res 133:32–43

    Article  MATH  Google Scholar 

  • Roodbergen KJ, de Koster R (2001b) Routing methods for warehouses with multiple cross aisles. Int J Prod Res 39:1865–1883

    Article  MATH  Google Scholar 

  • Tarantilis CD, Zachariadis EE, Kiranoudis CT (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans Intell Trans Syst 10:255–271

    Article  Google Scholar 

  • Theys C, Braysy O, Dullaert W, Raa B (2010) Using a TSP heuristic for routing order pickers in warehouses. Eur J Oper Res 200:755–763

    Article  MATH  Google Scholar 

  • Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123:487–512

    Article  MATH  MathSciNet  Google Scholar 

  • Vaughan TS, Petersen CG (1999) The effect of warehouse cross aisles on order picking efficiency. Int J Prod Res 37:881–897

    Article  MATH  Google Scholar 

  • Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202:347–355

    Article  MATH  Google Scholar 

  • Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195:729–743

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Modena and Reggio Emilia, Via Amendola, 2, Padiglione Morselli, 42100, Reggio Emilia, Italy

    R. Gamberini, B. Rimini, M. Dell’Amico, F. Lolli & M. Bianchi

Authors
  1. R. Gamberini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Rimini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Dell’Amico
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. F. Lolli
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. Bianchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Gamberini .

Editor information

Editors and Affiliations

  1. , Department of Industrial and Mechanical, University of Bologna, Viale Risorgimento 2, Bologna, 40136, Bologna, Italy

    Riccardo Manzini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Gamberini, R., Rimini, B., Dell’Amico, M., Lolli, F., Bianchi, M. (2012). Design and Optimization of Picking in the Case of Multi-Item Multi-Location Multi-Pallet Customer Orders. In: Manzini, R. (eds) Warehousing in the Global Supply Chain. Springer, London. https://doi.org/10.1007/978-1-4471-2274-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2274-6_15

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2273-9

  • Online ISBN: 978-1-4471-2274-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation