In this report a multi-modal freight transport improvement problem is formulated, and a heuristic solution procedure is developed for large scale problems. Arcs on a multi-modal network are modified to minimize the sum of investment and shipper disutility. The model includes a mode abstract multinomial logit model and convex arc transport characteristic improvement functions. The procedure is based on the general Continuous Optimal Adjustment heuristic suggested by Steenbrink; a major component is a concave transportation assignment problem, for which two methods are developed: a Dantzig-Wolfe decomposition to solve an arc-path form of the general multi-commodity fixed charge network flow problem, and a heuristic based on the local optimum seeking procedure of Yaged. The latter was programmed and thirty test runs were made on a problem derived from the Multi-State Transportation Corridor research program. Conclusions reached are: the solution procedure is viable; although times are long, this is not unusual for problems of this size or design construction projects of this scale; solution times may be shortened considerably by proper selection of parameters. As a final step, the procedure is extended to include multiple transport commodity classes.
Single-Commodity and Multi-Commodity Network Improvement Procedures
1979
294 pages
Report
Keine Angabe
Englisch
Transportation , Operations Research , Cargo transportation , Network flows , Transportation models , Transportation management , Mathematical models , Computer programs , Subroutines , Optimization , Heuristic methods , Theses , MNETED computer program , MMS computer program , MINFOD computer program , MINAC computer program , MTESTMS computer program , MCNCASB computer program
TIBKAT | 1963
|COMMODITY PROVIDING APPARATUS, COMMODITY PROVIDING METHOD, PROGRAM, AND COMMODITY PROVIDING SYSTEM
Europäisches Patentamt | 2019
|A multi-commodity flow network design problem
Elsevier | 1980
|COMMODITY MANAGEMENT SYSTEM AND COMMODITY MANAGEMENT APPARATUS
Europäisches Patentamt | 2022
|Multicommodity vs. Single-Commodity Routing
British Library Online Contents | 2016
|