MULTIVEHICLE TANKER SCHEDULING PROBLEM

The G.B. Dantzig and D.R. Fulkerson Tanker Scheduling Problem 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 is 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. The problem to consider different carrying capabilities of the vehicles is further extended and a mixed integer linear program that permits partially loaded tankers is formulated.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Authors:
  • Bellmore, M
  • Bennington, G
  • Lubore, S
• Publication Date: 1971-2

Media Info

• Features: References;
• Pagination: p. 36-47
• Serial:
  • Transportation Science
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Network analysis (Planning); Optimization; Routing; Scheduling; Ships; Tanker shipping
• Uncontrolled Terms: Network flows; Ship routing
• Old TRIS Terms: Tanker scheduling
• Subject Areas: Marine Transportation; Vehicles and Equipment;

Filing Info

• Accession Number: 00019412
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Nov 19 1972 12:00AM