OR Spectrum

pp 1–31 | Cite as

Integrated order picking and vehicle routing with due dates

Regular Article


Supermarkets typically order their goods from a centrally located distribution center (warehouse). Each order that the warehouse receives is characterized by the requested items, the location of the respective supermarket and a due date by which the items have to be delivered. For processing an order, a human operator (order picker) retrieves the requested items from their storage locations in the warehouse first. The items are then available for shipment and loaded on the vehicle which performs the tour including the respective location of the supermarket. Whether and to which extent a due date is violated (tardiness) depends on the composition of the tours, the corresponding routes and the start dates of the tours (vehicle routing subproblem). The start date of a tour, however, is also affected by the assignment of orders to pickers and the sequence according to which the orders are processed by the pickers (order picking subproblem). Although both subproblems are closely interconnected, they have not been considered simultaneously in the literature so far. In this paper, an iterated local search algorithm is designed for the simultaneous solution of the subproblems. By means of extensive numerical experiments, it is shown that the proposed approach is able to generate high-quality solutions even for large instances. Furthermore, the economic benefits of an integrated solution are investigated. Problem classes are identified, where the sequential solution of the subproblems leads to acceptable results, and it is pointed out in which cases an integrated solution is inevitable.


Order picking Vehicle routing Iterated local search 


  1. Alidaee B, Rosa D (1997) Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput Oper Res 24:775–788CrossRefGoogle Scholar
  2. Azi N, Gendreau M, Potvin J-Y (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 78:755–766CrossRefGoogle Scholar
  3. Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202:756–763CrossRefGoogle Scholar
  4. Azi N, Gendreau M, Potvin J-Y (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput Oper Res 41:167–173CrossRefGoogle Scholar
  5. Azizoglu M, Kirca O (1998) Tardiness minimization on parallel machines. Int J Prod Econ 55:163–168CrossRefGoogle Scholar
  6. Baker KR, Bertrand JWM (1981) An investigation of due-date assignment rules with constrained tightness. J Oper Manag 1:109–120CrossRefGoogle Scholar
  7. Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Oper Manag 3:37–42CrossRefGoogle Scholar
  8. Biskup D, Herrmann J, Gupta JND (2008) Scheduling identical parallel machines to minimize total tardiness. Int J Prod Econ 115:134–142CrossRefGoogle Scholar
  9. Brah SA (1996) A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod Plan Controls 7:362–373CrossRefGoogle Scholar
  10. Brandão J, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Oper Res 100:180–191CrossRefGoogle Scholar
  11. Brucker P, Hurink J, Werner F (1996) Improving local search heuristics for some scheduling problems. Part I. Discrete Appl Math 65:97–122CrossRefGoogle Scholar
  12. Brucker P, Hurink J, Werner F (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Appl Math 72:47–69CrossRefGoogle Scholar
  13. Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transport Sci 50:676–693CrossRefGoogle Scholar
  14. Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extension. Oper Res 58:130–148CrossRefGoogle Scholar
  15. Chen Z-L, Vairaktarakis GL (2005) Integrated scheduling of production and distribution operations. Manag Sci 51:614–628CrossRefGoogle Scholar
  16. Chiang W-C, Russell RA (2004) A metaheuristic for the vehicle-routeing problem with soft time windows. J Oper Res Soc 55:1298–1310CrossRefGoogle Scholar
  17. Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14:52–67CrossRefGoogle Scholar
  18. Desaulniers G, Madsen OBG, Ropke S (2014) The vehicle routing problem with time windows. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods and applications, 2nd edn. Society for Industrial and Applied Mathematics and the Mathematical Optimization Society, Philadelphia, pp 119–160CrossRefGoogle Scholar
  19. Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 1:161–175CrossRefGoogle Scholar
  20. DVZ—Deutsche Verkehrszeitung (2013) Wir liefern künftig im 24-Stunden-Rhythmus. http://www.dvz.de/rubriken/logistik-verlader/single-view/nachricht/24-stunden-belieferung-ueber-alle-sortimente.html. Accessed 22 Mar 2017
  21. Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirtschaftswissenschaften, Universität HamburgGoogle Scholar
  22. Fu Z, Eglese R, Li LYO (2008) A unified tabu search algorithm for vehicle routing problems with soft time windows. J Oper Res Soc 59:663–673CrossRefGoogle Scholar
  23. Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13–25CrossRefGoogle Scholar
  24. Grosso A, Della Croce F, Tadei R (2004) An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper Res Lett 32:68–72CrossRefGoogle Scholar
  25. Gupta JND, Maykut AR (1973) Concepts, theory, and techniques—scheduling jobs on parallel processors with dynamic programming. Decis Sci 4:447–457CrossRefGoogle Scholar
  26. Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467CrossRefGoogle Scholar
  27. Henke T, Speranza MG, Wäscher G (2015) The multi-compartment vehicle routing problem with flexible compartment sizes. Eur J Oper Res 246:730–743CrossRefGoogle Scholar
  28. Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf 27:86–114CrossRefGoogle Scholar
  29. Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Indus Eng 66:338–351CrossRefGoogle Scholar
  30. Ho JC, Chang Y-L (1991) Heuristic for minimizing mean tardiness of m parallel machines. Naval Res Logist 38:367–381CrossRefGoogle Scholar
  31. Hübner A, Ostermeier M (2016) A multi-compartment vehicle routing problem with loading and unloading costs. Working Paper, Catholic University Eichstätt-IngolstadtGoogle Scholar
  32. Hurter AP, Van Buer MG (1996) The newspaper production/distribution problem. J Bus Logist 17:85–107Google Scholar
  33. Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiura M (2008) An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl Math 156:2050–2069CrossRefGoogle Scholar
  34. Koulamas C (1997) Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Res Logist 44:109–125CrossRefGoogle Scholar
  35. Li C-L, Vairaktarakis GL, Lee C-Y (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164:39–51CrossRefGoogle Scholar
  36. Li K, Zhou C, Leung JY-T, Ma Y (2016) Integrated production and delivery with single machine and multiple vehicles. Expert Syst Appl 57:12–20CrossRefGoogle Scholar
  37. Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9:49–82CrossRefGoogle Scholar
  38. Lourenço HR, Martin OC, Stützle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, vol 146, 2nd edn. International series in operations research and management science. Springer, New York, pp 363–397CrossRefGoogle Scholar
  39. Low C, Li R-K, Chang C-M (2013) Integrated scheduling of production and delivery with time windows. Int J Prod Res 51:897–909CrossRefGoogle Scholar
  40. Low C, Chang C-M, Li R-K, Huang C-L (2014) Coordination of production scheduling and delivery problems with heterogeneous fleet. Int J Prod Res 153:139–148CrossRefGoogle Scholar
  41. Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34:28–47CrossRefGoogle Scholar
  42. Petch R, Salhi S (2004) A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl Math 133:69–92CrossRefGoogle Scholar
  43. Pinedo ML (2016) Scheduling: theory, algorithms, and systems, 5th edn. Springer, ChamCrossRefGoogle Scholar
  44. Polacek M, Hartl RF, Doerner K (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10:613–627CrossRefGoogle Scholar
  45. Prescott-Gagnon E, Desaulniers G, Drexl M, Rousseau L-M (2010) European driver rules in vehicle routing with time windows. Transport Sci 44:455–473CrossRefGoogle Scholar
  46. Roodbergen KJ (2001) Layout and routing methods for warehouses. Trial, RotterdamGoogle Scholar
  47. Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224:435–448CrossRefGoogle Scholar
  48. Scholz A, Schubert D, Wäscher G (2017) Order picking with multiple pickers and due dates—simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur J Oper Res 263:461–478CrossRefGoogle Scholar
  49. Shim S-O, Kim Y-D (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177:135–146CrossRefGoogle Scholar
  50. Taillard D, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47:1065–1070CrossRefGoogle Scholar
  51. Taillard D, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31:170–186CrossRefGoogle Scholar
  52. Tarantilis CD, Kiranoudis CT, Vassiliadis VS (2004) A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Oper Res 152:148–158CrossRefGoogle Scholar
  53. Ullrich CA (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227:152–165CrossRefGoogle Scholar
  54. Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115:237–253CrossRefGoogle Scholar
  55. Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231:1–21CrossRefGoogle Scholar
  56. Yalaoui F, Chu C (2002) Parallel machine scheduling to minimize total tardiness. Int J Prod Econ 76:265–279CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Economics and ManagementOtto-von-Guericke University MagdeburgMagdeburgGermany
  2. 2.Department of OperationsCatholic University of Eichstätt-IngolstadtIngolstadtGermany
  3. 3.School of Mechanical, Electronic and Control EngineeringBeijing Jiaotong UniversityBeijingChina

Personalised recommendations