Vehicle minimization for periodic deliveries

We consider the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries to a set of customers, under the initial assumption that each delivery requires the use of a vehicle for a full day. This problem is motivated by inventory routing problems in which customers consume goods at a steady rate. We evaluate the complexity of the problem and discuss its general properties, including problem decomposition. We also present an algorithm that we show is optimal for special cases. Finally, we extend these results to a general version of the problem.

[1]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[2]  Giuseppe Paletta,et al.  Management of periodic demands in distribution systems , 1985 .

[3]  James B. Orlin,et al.  Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets , 1982, Oper. Res..

[4]  R. Roundy.  98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems , 1985 .

[5]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[6]  Eugene Levner,et al.  Minimizing the number of robots to meet a given cyclic schedule , 1997, Ann. Oper. Res..

[7]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[8]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[9]  TAE-EOG LEE,et al.  Performance Measures and Schedules in Periodic Job Shops , 1997, Oper. Res..

[10]  Guillermo Gallego,et al.  On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R -systems , 1990 .

[11]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[12]  Kyung S. Park,et al.  Technical Note - Optimal Scheduling of Periodic Activities , 1985, Oper. Res..

[13]  Louis E. Rosier,et al.  On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor , 1990, MFCS.

[14]  Kyung S. Park,et al.  Optimal Scheduling of Periodic Activities , 1985 .

[15]  Giuseppe Paletta,et al.  A Heuristic for the Periodic Vehicle Routing Problem , 1992, Transp. Sci..

[16]  Jan Karel Lenstra,et al.  Periodic Multiprocessor Scheduling , 1991, PARLE.

[17]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[18]  Thomas W. Hungerford.  Abstract Algebra: An Introduction , 1990 .

[19]  Eugene Levner,et al.  Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case , 1998, Eur. J. Oper. Res..

[20]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[21]  Marielle Christiansen,et al.  A method for solving ship routing problemswith inventory constraints , 1998, Ann. Oper. Res..