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)


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Further Extensions of the Tanker Scheduling Problem


    Contributors:
    M. Bellmore (author) / G. Bennington (author) / S. Lubore (author)

    Publication date :

    1969


    Size :

    42 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Tanker scheduling

    Briskin, Lawrenc | TIBKAT | 1963




    Air Refueling Tanker Scheduling

    H. C. Hostler | NTIS | 1987


    Super tanker problem

    Hale, J.W. / O'Connel, H. | Engineering Index Backfile | 1956