Abstract Several methods are discussed for minimizing the sum of linear collection/distribution costs from/to a number of zones, and non-linear costs at processing ports. The non-optimality and computational implications of approximating non-linear cost functions for use with the linear programming technique are discussed. A simple graphical technique is presented and two computational algorithms are developed which make use of the special structure of the problem. The algorithms are illustrated using a simple example. Both algorithms converge to global optima. One is more suitable for hand calculation and the other is easier to program, but both are easily programmed and are computationally efficient.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simple algorithms for minimizing the sum of linear shipment costs and convex port costs


    Contributors:

    Published in:

    Publication date :

    1981-01-16


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Minimizing operating costs

    TERRELL, B. | AIAA | 1977



    Minimizing Energies with Hierarchical Costs

    Delong, A. / Gorelick, L. / Veksler, O. et al. | British Library Online Contents | 2012


    Real-Time Routing of Shipments Considering Transfer Costs and Shipment Characteristics

    B. S. Boardman / E. M. Malstrom / C. D. Bowling et al. | NTIS | 1997


    Minimizing Costs in Crude Oil Transportation

    Sassano, A. | Springer Verlag | 1988