AN EVENT-BASED APPROACH TO MODELLING INTERMODAL FREIGHT SYSTEMS. IN: TRANSPORT LOGISTICS
暂无分享,去创建一个
[1] A J Richardson,et al. Freight mode choice: an application of the elimination by aspects model , 1981 .
[2] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.
[3] William J. Baumol,et al. An Inventory Theoretic Model of Freight Transport Demand , 1970 .
[4] Bernard J. La Londe,et al. Industrial Buying Behavior and the Motor Carrier Selection Decision , 1972 .
[5] Y. P. Aneja,et al. Shortest chain subject to side constraints , 1983, Networks.
[6] R. Quandt,et al. THE DEMAND FOR ABSTRACT TRANSPORT MODES: THEORY AND MEASUREMENT. IN: URBAN TRANSPORT , 1966 .
[7] G. M. D'este. Carrier selection in a RO/RO ferry trade Part 2. Conceptual framework for the decision process , 1992 .
[8] Michael Florian,et al. Optimal strategies: A new assignment model for transit networks , 1989 .
[9] M A Brooks,et al. OCEAN CARRIER SELECTION CRITERIA IN A NEW ENVIRONMENT , 1990 .
[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[11] Patrick T. Harker,et al. FREIGHT NETWORK EQUILIBRIUM: A REVIEW OF THE STATE OF THE ART , 1985 .
[12] S J Meyrick,et al. CARRIER SELECTION IN A RO/RO FERRY TRADE. , 1992 .
[13] Teodor Gabriel Crainic,et al. STRATEGIC PLANNING OF FREIGHT TRANSPORTATION: STAN, AN INTERACTIVE GRAPHIC SYSTEM , 1990 .
[14] R. I. Mehr,et al. LLOYD`S OF LONDON , 1957 .
[15] A. Tversky. Elimination by aspects: A theory of choice. , 1972 .
[16] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[17] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[18] F. D. Gallagher,et al. ASEAN-Australia liner shipping : a cost-based simulation analysis , 1984 .