Rounding procedures for the discrete version of the capacitated economic order quantity problem

The capacitated Economic Order Quantity problem (capacitated EOQ) is a well-known problem where products have to be shipped between two points with a vehicle of given capacity. Each shipment has a fixed cost, independent of the shipped quantity, and an inventory cost is generated in the two points. The problem consists in finding the optimal time between consecutive shipments, which minimizes the total cost. The problem is a capacitated variant of the EOQ problem and has a closed form solution. Since such solution is often irrational, it is often rounded to an integer value. In this paper we investigate the errors which are generated by rounding procedures to integer and powers-of-two values. We show that, although in the worst case a tight general relative error of 2 is generated by all the considered rounding procedures, the procedure which rounds to the best between the lower and upper values (integer or powers-of-two) has a performance of 1/2 (root2- + 1/root2-) approximate to 1.06 on classes of instances of high practical relevance.