Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times

作者：Bertazzi Luca^*; Chan Lap Mui Ann

来源：Journal of Optimization Theory and Applications, 2014, 163(1): 286-309.

DOI：10.1007/s10957-013-0476-4

• Logistics
• Inventory
• Transportation
• Worst-case analysis

We study an inventory-transportation problem where one product has to be shipped from an origin to a destination by vehicles of given capacity over an infinite time horizon. The product is made available at the origin and consumed at the destination at the same constant rate. The intershipment time must be not lower than a given minimum value. The problem is to decide when to make the shipments and how to load the vehicles to minimize the sum of the transportation and the inventory costs at the origin and at the destination per time unit. We study the case in which the intershipment time is a multiple of the minimum value, i.e., the problem with discrete shipping times. We show that, in this case, the best double frequency policy has a tight performance bound of about 1.1603 with respect to the optimal periodic policy and of about 1.1538 with respect to the best frequency-based policy. Moreover, we show that, from the worst-case point of view, the best double frequency policy is the optimal frequency-based policy.

• 出版日期2014-10