Skip to main content

Advertisement

SpringerLink
Log in

Integrated order picking and vehicle routing with due dates

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Alidaee B, Rosa D (1997) Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput Oper Res 24:775–788

    Article  Google Scholar 

  • 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–766

    Article  Google Scholar 

  • 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–763

    Article  Google Scholar 

  • 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–173

    Article  Google Scholar 

  • Azizoglu M, Kirca O (1998) Tardiness minimization on parallel machines. Int J Prod Econ 55:163–168

    Article  Google Scholar 

  • Baker KR, Bertrand JWM (1981) An investigation of due-date assignment rules with constrained tightness. J Oper Manag 1:109–120

    Article  Google Scholar 

  • Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Oper Manag 3:37–42

    Article  Google Scholar 

  • Biskup D, Herrmann J, Gupta JND (2008) Scheduling identical parallel machines to minimize total tardiness. Int J Prod Econ 115:134–142

    Article  Google Scholar 

  • 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–373

    Article  Google Scholar 

  • 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–191

    Article  Google Scholar 

  • Brucker P, Hurink J, Werner F (1996) Improving local search heuristics for some scheduling problems. Part I. Discrete Appl Math 65:97–122

    Article  Google Scholar 

  • Brucker P, Hurink J, Werner F (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Appl Math 72:47–69

    Article  Google Scholar 

  • Cattaruzza D, Absi N, Feillet D (2016) The multi-trip vehicle routing problem with time windows and release dates. Transport Sci 50:676–693

    Article  Google Scholar 

  • Chen Z-L (2010) Integrated production and outbound distribution scheduling: review and extension. Oper Res 58:130–148

    Article  Google Scholar 

  • Chen Z-L, Vairaktarakis GL (2005) Integrated scheduling of production and distribution operations. Manag Sci 51:614–628

    Article  Google Scholar 

  • Chiang W-C, Russell RA (2004) A metaheuristic for the vehicle-routeing problem with soft time windows. J Oper Res Soc 55:1298–1310

    Article  Google Scholar 

  • 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–67

    Article  Google Scholar 

  • 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–160

    Chapter  Google Scholar 

  • Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 1:161–175

    Article  Google Scholar 

  • 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

  • EDEKA Minden-Hannover. (2017) http://www.edekaverbund.de/Unternehmen/de/edeka_minden_hannover/unternehmen_minden_hannover/zahlen_daten_fakten/zahlen_daten_fakten_minden_hannover.jsp. Accessed 22 Mar 2017

  • Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg

  • 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–673

    Article  Google Scholar 

  • Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13–25

    Article  Google Scholar 

  • 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–72

    Article  Google Scholar 

  • Gupta JND, Maykut AR (1973) Concepts, theory, and techniques—scheduling jobs on parallel processors with dynamic programming. Decis Sci 4:447–457

    Article  Google Scholar 

  • Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467

    Article  Google Scholar 

  • Henke T, Speranza MG, Wäscher G (2015) The multi-compartment vehicle routing problem with flexible compartment sizes. Eur J Oper Res 246:730–743

    Article  Google Scholar 

  • Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf 27:86–114

    Article  Google Scholar 

  • Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Indus Eng 66:338–351

    Article  Google Scholar 

  • Ho JC, Chang Y-L (1991) Heuristic for minimizing mean tardiness of m parallel machines. Naval Res Logist 38:367–381

    Article  Google Scholar 

  • Hübner A, Ostermeier M (2016) A multi-compartment vehicle routing problem with loading and unloading costs. Working Paper, Catholic University Eichstätt-Ingolstadt

  • Hurter AP, Van Buer MG (1996) The newspaper production/distribution problem. J Bus Logist 17:85–107

    Google Scholar 

  • 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–2069

    Article  Google Scholar 

  • Koulamas C (1997) Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Res Logist 44:109–125

    Article  Google Scholar 

  • Li C-L, Vairaktarakis GL, Lee C-Y (2005) Machine scheduling with deliveries to multiple customer locations. Eur J Oper Res 164:39–51

    Article  Google Scholar 

  • 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–20

    Article  Google Scholar 

  • Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9:49–82

    Article  Google Scholar 

  • 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–397

    Chapter  Google Scholar 

  • Low C, Li R-K, Chang C-M (2013) Integrated scheduling of production and delivery with time windows. Int J Prod Res 51:897–909

    Article  Google Scholar 

  • 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–148

    Article  Google Scholar 

  • Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34:28–47

    Article  Google Scholar 

  • Petch R, Salhi S (2004) A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl Math 133:69–92

    Article  Google Scholar 

  • Pinedo ML (2016) Scheduling: theory, algorithms, and systems, 5th edn. Springer, Cham

    Book  Google Scholar 

  • 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–627

    Article  Google Scholar 

  • Prescott-Gagnon E, Desaulniers G, Drexl M, Rousseau L-M (2010) European driver rules in vehicle routing with time windows. Transport Sci 44:455–473

    Article  Google Scholar 

  • Roodbergen KJ (2001) Layout and routing methods for warehouses. Trial, Rotterdam

    Google Scholar 

  • Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224:435–448

    Article  Google Scholar 

  • 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–478

    Article  Google Scholar 

  • Shim S-O, Kim Y-D (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177:135–146

    Article  Google Scholar 

  • Taillard D, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47:1065–1070

    Article  Google Scholar 

  • 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–186

    Article  Google Scholar 

  • 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–158

    Article  Google Scholar 

  • Ullrich CA (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227:152–165

    Article  Google Scholar 

  • Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115:237–253

    Article  Google Scholar 

  • 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–21

    Article  Google Scholar 

  • Yalaoui F, Chu C (2002) Parallel machine scheduling to minimize total tardiness. Int J Prod Econ 76:265–279

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics and Management, Otto-von-Guericke University Magdeburg, 39106, Magdeburg, Germany

    Daniel Schubert, André Scholz & Gerhard Wäscher

  2. Department of Operations, Catholic University of Eichstätt-Ingolstadt, 85049, Ingolstadt, Germany

    Daniel Schubert

  3. School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, 100044, China

    Gerhard Wäscher

Authors
  1. Daniel Schubert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Scholz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerhard Wäscher
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to André Scholz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Schubert, D., Scholz, A. & Wäscher, G. Integrated order picking and vehicle routing with due dates. OR Spectrum 40, 1109–1139 (2018). https://doi.org/10.1007/s00291-018-0517-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-018-0517-3

Keywords

Search

Navigation