Exact and heuristic solutions for a shipment problem with given frequencies

被引：21

作者：

Bertazzi, L ^{[1
]}

Speranza, MG

Ukovich, W

机构：

[1] Univ Brescia, Dipartimento Metodi Quantitat, I-25121 Brescia, Italy

[2] Univ Trieste, Dipartimento Elettrotecn & Elettron & Informat, I-34127 Trieste, Italy

来源：

MANAGEMENT SCIENCE | 2000年 / 46卷 / 07期

关键词：

transportation; inventory; dominance rules; branch-and-bound; heuristics;

D O I：

10.1287/mnsc.46.7.973.12032

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：973 / 988

页数：16

共 31 条

[1] A CLASS OF EUCLIDEAN ROUTING-PROBLEMS WITH GENERAL-ROUTE COST-FUNCTIONS [J].