Self Imposed Time Windows in Vehicle Routing Problems

[1]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[2]  James B. Orlin,et al.  New neighborhood search algorithms based on exponentially large neighborhoods , 2001 .

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[4]  Daniel A. Finke,et al.  Multiple machine JIT scheduling: a tabu search approach , 2007 .

[5]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[6]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[7]  Fred W. Glover,et al.  Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[8]  Roel Leus,et al.  Meta-heuristics for stable scheduling on a single machine , 2008, Comput. Oper. Res..

[9]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[10]  Alfonsas Misevicius,et al.  A Tabu Search Algorithm for the Quadratic Assignment Problem , 2005, Comput. Optim. Appl..

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

[12]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[13]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[14]  Ulrich Derigs,et al.  Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..

[15]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[16]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[17]  Willy Herroelen,et al.  The complexity of machine scheduling for stability with a single disrupted job , 2005, Oper. Res. Lett..

[18]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[19]  Roberto Baldacci,et al.  An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation , 2004, Oper. Res..

[20]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[21]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[22]  Clara Novoa.  Static and dynamic approaches for solving the vehicle routing problem with stochastic demands , 2005 .

[23]  Manuel Laguna,et al.  Tabu Search , 1997 .

[24]  Willy Herroelen,et al.  Scheduling for stability in single-machine production systems , 2007, J. Sched..

[25]  G. Dueck.  New optimization heuristics , 1993 .

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

[27]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[28]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

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

[30]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[31]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[32]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

[33]  Bruce L. Golden,et al.  Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries , 2002, The Vehicle Routing Problem.

[34]  Willy Herroelen,et al.  The construction of stable project baseline schedules , 2004, Eur. J. Oper. Res..

[35]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[36]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[37]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[38]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[39]  David Simchi-Levi,et al.  Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows , 1996, Oper. Res..

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

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

[42]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

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

[44]  Paul Glasserman,et al.  Gradient Estimation Via Perturbation Analysis , 1990 .