Abstract:
We consider optimal scheduling of shipments by different forms of transport. Optimization of interdependent flows in regional transportation networks is formulated as a minimum-cost-multicommodity flow problem with interdependent and convertible commodity flows. The problem of optimal allocation of goods flows to subnetworks using different forms of transport is formulated. A decomposition algorithm for large-scale problems is described.
Fulltext:
PDF file (1299 kB)