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

Sam Yagar and Roger L. Tobin

Transportation Research Part B: Methodological, 1982, vol. 16, issue 6, 421-434

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.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(82)90001-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:16:y:1982:i:6:p:421-434

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().