A Multi-flow Multi-modal Assignment Procedure on Large Freight Transportation Networks

Studies in Regional Science

Volumn 35, Issue 4, 2006, Pages 929-945

  Jourquin, Bart ^a  

^a Facultes Universitaires Catholiques de Mons   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85015549271     PISSN: 02876256     EISSN: 18806465     Source Type: Journal    
DOI: 10.2457/srs.35.929     Document Type: Article

References (19)

1. Bar-Gera, H. and Boyce, D., “Origin-based algorithms for combined travel forecasting models”, Transportation Research B, Vol. 37, No. 5, 2003, pp. 405-422.
2. Ben-Akiva, M., Bergman, M.J., Daly, A.J. and Ramaswamy, R., “Modelling Inter-Urban Route Choice Behavior”, Proceedings of the 9th International Symposium on Transportation and Traffic Theory, 1984, pp. 299-330.
3. Ben-Akiva, M. and Lerman, S.R., Discrete Choice Analysis, Cambridge, MIT Press, 1985.
4. Crainic, T.G., Florian, M., Guélat, J., and Spiess, H., “Strategic planning of freight transportation : Stan, an interactive graphic system”, Transportation research record, 1283, 1990, pp. 97-124.
5. Dial, R.B., “A probabilistic multipath traffic assignment model which obviates path enumeration”, Transportation Research, Vol. 5, 1971, pp. 83-111.
6. Dijkstra, E.W., “A note on two problems in connection with graphs”, Numerische Mathematik, Vol. 1, 1959, pp. 269-271.
7. Frank, M. and Wolfe, P., “An algorithm for quadratic programming”, Naval Research Logistics Quarterly, Vol. 3, 1956, pp. 95-110.
8. Geerts, J.F. and Jourquin, B., “Freight Transportation Planning on the European Multimodal Network : the case of the Walloon Region”, European Journal for Transport Infrastructure Research, Vol. 1, No. 1, 2001, pp. 99-106.
9. Harker, P.T., Predicting intercity freight flows, VNU Science Press, 1987.
10. Hart, P.E., Nilsson, N.J. and Raphael, B., “A Formal Basis for the Heuristic Determination of Minimum Cost Paths”, IEEE Transactions on Systems Science and Cybernetics SSC4 Vol. 2, 1968, pp. 100-107.
11. Hart, P.E., Nilsson, N.J. and Raphael, B., “Correction to” A Formal Basis for the Heuristic Determination of Minimum Cost Paths”, SIGART Newsletter, 37, 1972, pp. 28-29.
12. Hoffman, R. and Pavley, R.R., “A method for the solution of the nth best path problem”, Journal of the association for Computing Machinery, Vol. 6, 1959, pp. 506-514.
13. Jourquin, B., Un outil d'analyse économique des transports de marchandises sur des réseaux multi-modaux et multi-produits : Le réseau virtuel, concepts, méthodes et applications, PhD Thesis, Facultés Universitaires Catholiques de Mons, Belgium, 1995.
14. Jourquin, B. and Beuthe, M., “Transportation policy analysis with a geographic information system : the virtual network of freight transportation in Europe”, Transportation Research C, Vol. 4, No. 6, 1996, pp. 359-371.
15. Jourquin, B. and Limbourg, S., “Assignment techniques on Virtual Networks, Performance considerations on large multi-modal networks”, European Regional Science Association congress (ERSA) 2003, University of Jyväskylä—Finland, August 2003.
16. Martins, E.Q.V., Pascoal, M.M.B. and Santos, J.L.E., “A new improvement for a k shortest paths algorithm”, Investigação Operacional, 21 (1), 2001, pp. 47-60.
17. Ortúzar, J. de D. and Willumsen, L., Modelling Transport, John Wiley & Sons, New-York, 1990.
18. Sheffi, Y., Urban Transportation Networks : Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1985.
19. Smock, R.J., “An iterative assignment approach to capacity restraint on arterial networks”, Highway Research Board Bulletin, Vol. 156, 1962, pp. 1-13.