Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies
研究在离散运输频率下最小化运输与库存总成本的问题，提出支配规则改进分支定界算法，并比较多种启发式解法。
We consider the problem of shipping several products from an origin to a destination when a discrete set of shipping frequencies is available, in such a way that the sum of the transportation and inventory costs is minimized. This problem, which is known to be NP-hard, has applications in transportation planning and in location analysis. In this paper we derive dominance rules for the problem solutions that allow a tightening of the bounds on the problem variables and improve the efficiency of a known branch-and-bound algorithm. Moreover, we present some heuristics and compare them with two different modifications of an EOQ-type algorithm for the solution of the problem with continuous frequencies.