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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Yagar, Sam (Autor:in) / Tobin, Roger L. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1981-01-16


    Format / Umfang :

    14 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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


    Minimizing Costs in Crude Oil Transportation

    Sassano, A. | Springer Verlag | 1988


    Models for Minimizing Backhaul Costs through Freight Collaboration

    Bailey, Erin / Unnikrishnan, Avinash / Lin, Dung-Ying | Transportation Research Record | 2011