Skip to main content
SpringerLink
Log in

Recent progress of local search in handling the time window constraints of the vehicle routing problem

  • Invited Survey
  • Published:
4OR Aims and scope Submit manuscript

Abstract

Vehicle routing and scheduling problems have a wide range of applications and have been intensively studied in the past half century. The condition that enforces each vehicle to start service at each customer in the period specified by the customer is called the time window constraint. This paper reviews recent results on how to handle hard and soft time window constraints, putting emphasis on its different definitions and algorithms. With these diverse time windows, the problem becomes applicable to a wide range of real-world problems.

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

Similar content being viewed by others

References

  • Aarts, EHL, Lenstra, JK (eds) (1997) Local search in combinatorial optimization. Wiley, London

    Google Scholar 

  • Agarwal R, Ahuja RK, Laporte G, Shen Z-JM (2004) A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Leung JY-T (eds) Handbook of scheduling: algorithms, models, and performance analysis, Chapter 49. Chapman and Hall/CRC, London

    Google Scholar 

  • Ahuja RK, Orlin JB (2001) A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Oper Res 49(5): 784–789

    Article  Google Scholar 

  • Balakrishnan N (1993) Simple heuristics for the vehicle routeing problem with soft time windows. J Oper Res Soc 44: 279–287

    Google Scholar 

  • Best MJ, Chakravarti N (1990) Active set algorithms for isotonic regression; a unifying framework. Math Program 47(1): 425–439

    Article  Google Scholar 

  • Bramel J, Simchi-Levi D (1996) Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper Res 44(3): 501–509

    Article  Google Scholar 

  • Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15(4): 347–368

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transport Sci 39(1): 104–118

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: Metaheuristics. Transport Sci 39(1): 119–139

    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 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4): 568–581

    Article  Google Scholar 

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1): 80–91

    Article  Google Scholar 

  • Davis JS, Kanet JJ (1993) Single-machine scheduling with early and tardy completion costs. Nav Res Logist 40: 85–101

    Article  Google Scholar 

  • Desrochers M, Lenstra JK, Savelsbergh MWP, Soumis F (1988) Vehicle routing with time windows: optimization and approximation. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies, studies in management science and systems. North-Holland, Amsterdam, pp 65–84

    Google Scholar 

  • Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Network routing, volume 8 of Handbooks in operations research and management science Chap. 2. North-Holland, Amsterdam, pp 35–139

    Google Scholar 

  • Dumas Y, Soumis F, Desrosiers J (1990) Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transport Sci 24(2): 145–152

    Article  Google Scholar 

  • Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11: 109–124

    Article  Google Scholar 

  • 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 

  • Funke B, Grünert T, Irnich S (2005) Local search for vehicle routing and scheduling problems: review and conceptual integration. J Heuristics 11: 267–306

    Article  Google Scholar 

  • Garey MR, Tarjan RE, Wilfong GT (1988) One-processor scheduling with symmetric earliness and tardiness penalties. Math Oper Res 13(2): 330–348

    Article  Google Scholar 

  • Golden, B, Raghavan, S, Wasil, E (eds) (2008) The vehicle routing problem. Springer, Berlin

    Google Scholar 

  • Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl Math 154: 2271–2290

    Article  Google Scholar 

  • Hashimoto H, Yagiura M (2008) A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. In: Proceedings of the eighth European conference on evolutionary computation in combinatorial optimization (EvoCOP 2008), Lecture Notes in Computer Science, volume 4972, pp 254–265

  • Hashimoto H, Yagiura M, Ibaraki T (2008) An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim 5(2): 434–456

    Article  Google Scholar 

  • Hendel Y, Sourd F (2006) Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. Eur J Oper Res 173: 108–119

    Article  Google Scholar 

  • Hendel Y, Sourd F (2007) An improved earliness-tardiness timing algorithm. Comput Oper Res 34: 2931–2938

    Article  Google Scholar 

  • Hochbaum DS, Queyranne M (2003) Minimizing a convex cost closure set. SIAM J Discrete Math 16(2): 192–207

    Article  Google Scholar 

  • Ibaraki T, Imahori S, Kubo M, Masuda T, Uno T, Yagiura M (2005) Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transport Sci 39(2): 206–232

    Article  Google Scholar 

  • Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiuraz 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 

  • Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144: 379–396

    Article  Google Scholar 

  • Kedad-Sidhoum S, Sourd F (2010) Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Comput Oper Res 37: 1464–1471

    Article  Google Scholar 

  • Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: handling edge exchanges. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 337–360

    Google Scholar 

  • Koskosidis YA, Powell WB, Solomon MM (1992) An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transport Sci 26(2): 69–85

    Article  Google Scholar 

  • Laporte G (2009) Fifty years of vehicle routing. Transport Sci 43(4): 408–416

    Article  Google Scholar 

  • Lawler, EL, Lenstra, JK, Rinnooy Kan, AHG, Shmoys, DB (eds) (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester

    Google Scholar 

  • Liberatore F, Righini G, Salani M (2010) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR (to appear)

  • Lim A, Zhang X (2007) A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS J Comput 19: 443–457

    Article  Google Scholar 

  • Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44: 2245–2269

    Google Scholar 

  • Nagata Y (2007) Effective memetic algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW. In: Proceedings of the seventh metaheuristics international conference (MIC2007)

  • Nagata Y, Bräysy O (2009) A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper Res Lett 37(5): 333–338

    Article  Google Scholar 

  • Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37: 724–737

    Article  Google Scholar 

  • Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL

  • Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41: 421–451

    Article  Google Scholar 

  • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34: 2403–2435

    Article  Google Scholar 

  • Potvin J-Y, Kervahut T, Garcia B-L, Rousseau J-M (1996) The vehicle routing problem with time windows part I: tabu search. INFORMS J Comput 8(2): 158–164

    Article  Google Scholar 

  • Qi C, Cui S, Sun Y (2008) Using ant colony system and local search methods to solve VRPTW. In: IEEE Pacific-Asia workshop on computational intelligence and industrial application, pp 478–482

  • Reiter S, Sherman G (1965) Discrete optimizing. J Soc Ind Appl Math 13(3): 864–889

    Article  Google Scholar 

  • Rosenkrantz DJ, Stearns RE, Lewis PM II (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6(3): 563–581

    Article  Google Scholar 

  • Sakuraba CS, Ronconi DP, Sourd F (2009) Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Comput Oper Res 36(1): 60–72

    Article  Google Scholar 

  • Sexton TR, Bodin LD (1985) Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling. Transport Sci 19(4): 378–410

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2): 254–265

    Article  Google Scholar 

  • Solomon MM, Desrosiers J (1988) Time window constrained routing and scheduling problems. Transport Sci 22(1): 1–13

    Article  Google Scholar 

  • Sourd F (2005) Optimal timing of a sequence of tasks with general completion costs. Eur J Oper Res 165: 82–96

    Article  Google Scholar 

  • Taillard É, 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(2): 170–186

    Article  Google Scholar 

  • Tamaki H, Komori T, Abe S (1999a) A heuristic approach to parallel machine scheduling with earliness and tardiness penalties. In: Proceedings of the seventh IEEE international conference on emerging technologies and factory automation (ETFA ’99). Barcelona, Catalonia, Spain, pp 1367–1370

  • Tamaki H, Sugimoto T, Araki M (1999b) Parallel machine scheduling problem with a non-regular objective function. minimizing the sum of earliness and tardiness penalties (in Japanese). Trans Soc Instrum Control Eng 35(9): 1176–1182

    Google Scholar 

  • Thompson PM, Orlin JB (1989) The theory of cyclic transfers. Technical report, Massachusetts Institute of Technology, Operations Research Center

  • Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper Res 41(5): 935–946

    Article  Google Scholar 

  • Toth, P, Vigo, D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia

    Google Scholar 

  • Yagiura M, Ibaraki T (1999) Analyses on the 2 and 3-flip neighborhoods for the MAX SAT. J Comb Optim 3(1): 95–114

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan

    Hideki Hashimoto

  2. Department of Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Furocho, Chikusa-ku, Nagoya, 464-8603, Japan

    Mutsunori Yagiura

  3. Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University, Furocho, Chikusa-ku, Nagoya, 464-8603, Japan

    Shinji Imahori

  4. The Kyoto College of Graduate Studies for Informatics, 7 Monzencho, Tanaka, Sakyo-ku, Kyoto, 606-8225, Japan

    Toshihide Ibaraki

Authors
  1. Hideki Hashimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mutsunori Yagiura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shinji Imahori
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hideki Hashimoto.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hashimoto, H., Yagiura, M., Imahori, S. et al. Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR-Q J Oper Res 8, 221–238 (2010). https://doi.org/10.1007/s10288-010-0144-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-010-0144-6

Keywords

MSC classification (2000)

Search

Navigation