Abstract
The problem addressed in this paper is as follows: At each of a number of origin ports is available a given quantity of a single type of crude oil. Likewise, we are given quantities of crude oil required by a number of refineries (destination ports) in order to meet their production schedules. Finally a fleet of tankers with given volume capacity, weight capacity and speeds is available.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Appelgren, L.H. (1971), Integer Programming Methods for a Vessel Scheduling Problem, Transportation Science 5, 64–78.
Bellmore M., G. Bennington and S.Lubore (1968), A Maximum Utility Solution to a Vehicle Constrained Tanker Scheduling Problem, Naval Research Logistics Quarterly 15, 404–411.
Bellmore M., G. Bennington and S.Lubore (1969), Further Extensions of the Tanker Scheduling Problem, Presented at the 36th National Operations Research Society Meeting in Miami, Florida, November 1969.
Dantzig, G.B. and D.R. Fulkerson (1954), Minimizing the number of tankers to Meet a Schedule, Naval Research Logistics Quarterly, 1, 217–222.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sassano, A. (1988). Minimizing Costs in Crude Oil Transportation. In: Bianco, L., La Bella, A. (eds) Freight Transport Planning and Logistics. Lecture Notes in Economics and Mathematical Systems, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02551-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-02551-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50232-6
Online ISBN: 978-3-662-02551-2
eBook Packages: Springer Book Archive