An Algorithm for Commodity Distribution Among Two Kinds of Transportation Possibly to be Used in the Silistra Region Project

Mihailov B (1978). An Algorithm for Commodity Distribution Among Two Kinds of Transportation Possibly to be Used in the Silistra Region Project. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-78-043

[img]
Preview
Text
WP-78-043.pdf

Download (124kB) | Preview

Abstract

This algorithm is a modified Ford-Fulkerson method for the shortest distance in a set, in which the transformed transportation costs are used instead of the transportation distance. For this purpose a set of commodity destinations serves as a basis for sketching of the sections and crosspoints of the two transports. It is supposed that there is no friction limitation and the initial, final, surcharge and transit operation expenditures are assigned.

Item Type: Monograph (IIASA Working Paper)
Research Programs: General Research (GEN)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:44
Last Modified: 19 Jul 2016 12:10
URI: http://pure.iiasa.ac.at/868

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313