A Multivehicle Tanker Scheduling Problem

M. Bellmore, G. Bennington and S. Lubore
Additional contact information
M. Bellmore: The Johns Hopkins University, Baltimore, Maryland
G. Bennington: North Carolina State University, Raleigh, North Carolina
S. Lubore: The MITRE Corporation, McLean, Virginia

Transportation Science, 1971, vol. 5, issue 1, 36-47

Abstract: The Dantzig and Fulkerson Tanker Scheduling Problem is concerned with the determination of the minimum size and optimal routing of a fleet of homogeneous tankers needed to meet a prescribed schedule of deliveries. This problem has been formulated as a network flow problem. Later formulations consider an existing nonhomogeneous tanker fleet and relax the fixed shipping schedule. These problems are treated as multicommodity minimal cost flow problems. This paper further extends the problem to consider differing carrying capabilities of the vehicles and formulates a mixed integer linear program that permits partially loaded tankers. A branch-and-bound enumerative scheme in conjunction with a decomposed linear program with network sub-problems is presented.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.5.1.36 (application/pdf)

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:inm:ortrsc:v:5:y:1971:i:1:p:36-47

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().