Premium
An algorithm for optimal shipments with given frequencies
Author(s) -
Speranza M. G.,
Ukovich W.
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199608)43:5<655::aid-nav4>3.0.co;2-4
Subject(s) - mathematical optimization , simple (philosophy) , set (abstract data type) , integer programming , product (mathematics) , computer science , computational complexity theory , integer (computer science) , branch and bound , transportation theory , time complexity , dynamic programming , mathematics , algorithm , philosophy , geometry , epistemology , programming language
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed‐integer programming model—shown to be NP‐hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP‐hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch‐and‐bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc.