FURTHER EXTENSIONS OF THE TANKER SCHEDULING PROBLEM,
Abstract
Several modifications to the Dantzig and Fulkerson tanker scheduling problem are described. The original formulation addressed the determination of the minimal number of homogeneous tankers needed to meet a fixed schedule of deliveries. An earlier modification considered an insufficient number of vehicles to make all deliveries and a set of utilities associated with each vehicle delivery. The maximum utility solution to this problem can be found using the Fulkerson out-of kilter algorithm. The paper further extends the vehicle constrained problem to allow a span of feasible delivery times in lieu of a fixed schedule. This extension results in nonintegral valued flows in the network, precluding the application of network algorithms. The concept of a generalized bundle constraint is presented and a column-generation linear programming solution technique is described. The paper considers extensions to a fleet of vehicles with differing characteristics. A solution technique for the multicommodity flow problem is described. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1969
- Accession Number
- AD0696364
Entities
People
- G. Bennington
- M. Bellmore
- S. Lubore
Organizations
- MITRE Corporation