The many‐product cargo loading problem

Peter Mark Pruzan and J. T. Ross Jackson

Naval Research Logistics Quarterly, 1967, vol. 14, issue 3, 381-390

Abstract: An algorithm, based upon dynamic programming, is developed for a class of fixed‐cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800140309

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:14:y:1967:i:3:p:381-390

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().