The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem

This paper introduces the vehicle routing problem with soft time windows (VRPSTW) in which problem definition differs from ones previously defined in literature. Branch-and-price approach is employed, resulting in a set partitioning master problem and its new subproblem. Novel techniques are consequently developed to solve this new subproblem. Experimental results report the comparisons of these solution techniques under the branch-and-price framework. The VRPSTW solutions have further been compared to the state-of-the-art literature, signifying the superiority of the VRPSTW on this issue.

[1]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[2]  Brian Kallehauge,et al.  Lagrangian duality applied to the vehicle routing problem with time windows , 2006, Comput. Oper. Res..

[3]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[4]  Richard W. Eglese,et al.  A unified tabu search algorithm for vehicle routing problems with soft time windows , 2008, J. Oper. Res. Soc..

[5]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[6]  Michel Gendreau,et al.  An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..

[7]  Eiichi Taniguchi,et al.  An exact solution approach for vehicle routing and scheduling problems with soft time windows , 2009 .

[8]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[9]  Guy Desaulniers.  Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation , 2007, Comput. Oper. Res..

[10]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[11]  Miguel A. Figliozzi,et al.  An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows , 2010 .

[12]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[13]  Eiichi Taniguchi,et al.  Exact solution for the vehicle routing problem with semi soft time windows and its application , 2010 .

[14]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[15]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[16]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[17]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[18]  Giovanni Righini,et al.  A column generation algorithm for the vehicle routing problem with soft time windows , 2011, 4OR.

[19]  Michel Gendreau,et al.  A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods , 2013, Eur. J. Oper. Res..

[20]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[21]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[22]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[23]  George Ioannou,et al.  A problem generator-solver heuristic for vehicle routing with soft time windows , 2003 .

[24]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

[25]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[26]  Kjetil Fagerholt,et al.  Ship scheduling with soft time windows: An optimisation based approach , 2001, Eur. J. Oper. Res..

[27]  J. Desrosiers,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .

[28]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[29]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[30]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[31]  Michel Gendreau,et al.  Arc routing problems with time-dependent service costs , 2007, Eur. J. Oper. Res..

[32]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[33]  Eiichi Taniguchi,et al.  Modelling City Logistics , 1999 .

[34]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[35]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[36]  J. Potvin,et al.  A dynamic capacitated arc routing problem with time-dependent service costs , 2011 .

[37]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[38]  Juliane Müller,et al.  Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows , 2010, Eur. J. Oper. Res..

[39]  Wen-Chyuan Chiang,et al.  A metaheuristic for the vehicle-routeing problem with soft time windows , 2004, J. Oper. Res. Soc..

[40]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[41]  Moshe Dror,et al.  Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..

[42]  Marco E. Lübbecke,et al.  Dual variable based fathoming in dynamic programs for column generation , 2005, Eur. J. Oper. Res..

[43]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[44]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[45]  Michel Gendreau,et al.  Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .

[46]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[47]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..

[48]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[49]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[50]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[51]  Ali Gul Qureshi.  A COLUMN GENERATION BASED EXACT SOLUTION FOR VEHICLE ROUTING AND SCHEDULING PROBLEM WITH SOFT TIME WINDOWS , 2008 .

[52]  Guy Desaulniers,et al.  Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows , 2010, INFOR Inf. Syst. Oper. Res..

[53]  Michel Gendreau,et al.  New Refinements for the Solution of Vehicle Routing Problems with Branch and Price , 2007, INFOR Inf. Syst. Oper. Res..

[54]  Michel Gendreau,et al.  A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs , 2010, Comput. Ind. Eng..