參考文獻 |
[1] Akamatsu T., “Decomposition of path choice entropy in general transport networks”, Transportation Science, Vol. 31, pp. 349-362, 1997.
[2] Aungsuyanon A., Boyce D. and Ran B., “Assessment of Adherence to the Condition of Proportionality in User Equilibrium Traffic Assignments with Uniquely Determined Route Flows”, Transportation Research Record: Journal of the Transportation Research Board, Vol. 2334(1), pp. 60-74, 2013.
[3] Arezki Y. and Van Vliet D., “A Comparison of Some Algorithms for the Traffic Assignment Problem with Fixed Demand”, Third mini European Conference in Transportation Problems, Herceg Novi, Yugoslavia, 1987.
[4] Arezki Y. and Van Vliet D., “A full analytical implementation of the PARTAN/Frank–Wolfe algorithm for equilibrium assignment”, Transportation Science, Vol. 24, pp. 58-62, 1990.
[5] Bar-Gera H. and Boyce D., “Route flow entropy maximization in origin-based traffic assignment”, Transportation and Traffic Theory: Flow, Dynamics and Human Interaction, Proceedings of the 14th International Symposium on Transportation and Traffic Theory, pp. 397-415, Elsevier, Oxford, 1999.
[6] Bar-Gera H., “Origin-based algorithm for the traffic assignment problem”, Transportation Science, Vol. 36, pp. 398-417, 2002.
[7] Bar-Gera H. and Boyce D., “User-equilibrium route set analysis of a large road network”, Transportation and Traffic Theory: Flow, Dynamics and Human Interaction, Proceedings of the 16th International Symposium on Transportation and Traffic Theory, pp. 673-692, Elsevier, Oxford, 2005.
[8] Bar-Gera H., “Traffic assignment by paired alternative segments”, Transportation Research Part B: Methodological, Vol. 44, pp. 1022-1046, 2010.
[9] Bar-Gera H., Nie Y., Boyce D., Hu Y. and Liu Y., “Consistent route flows and the condition of proportionality”, In the Proceedings of the 89th Annual Meeting of Transportation Research Board, CD-ROM, 2010.
[10] Bar-Gera H., Boyce D. and Nie Y. M., “User-equilibrium route flows and the condition of proportionality”, Transportation Research Part B: Methodological, Vol. 46, pp. 440-462, 2012.
[11] Bar-Gera H.: Transportation Network Test Problems, www.bgu.ac.il/~bargera/tntp.
[12] Beckmann M., McGuire C. B. and Winsten C. B., Studies in the Economics of Transportation, Yale University Press, New Haven, Connecticut, 1956.
[13] Bell M. G. H. and Iida Y., Transportation network analysis, Wiley (John) & Sons Limited, Sussex England, 1997.
[14] Bertsekas D. P., Gafni E. M. and Gallager R.G., “Second derivative algorithms for minimum delay distributed routing in networks”, Communications IEEE Transactions on, Vol. 32, pp. 911-919, 1984.
[15] Boyce D., Ralevic-Dekic B. and Bar-Gera H. “Convergence of traffic assignments: how much is enough?,”, Journal of Transportation Engineering, Vol. 130, pp. 49-55, 2004.
[16] Boyce D. and Xiong Q., “User-optimal and system-optimal route choices for a large road network”, Review of Network Economics, Vol. 3, pp.371-380, 2004.
[17] Boyce D. and Xie J., “Assigning user class link flows uniquely”, Transportation Research Part A: Policy and Practice, Vol. 53, pp. 22-35, 2013.
[18] Chang C. W., “Computational Efficiency of Path-based Algorithm in Solving the Dynamic User-optimal Route Choice Model”, National Central University, Master Thesis, 1997.
[19] Chang M. S. and Chen H. K., “A fuzzy user-optimal route choice problem using a link-based fuzzy variational inequality formulation”, Fuzzy sets and systems, Vol. 114, pp. 339-345, 2000.
[20] Chen H. K. and Hsueh C. F., “A model and an algorithm for the dynamic user-optimal route choice problem”, Transportation Research Part B: Methodological, Vol. 32, pp. 219- 234, 1998.
[21] Chen H. K. and Feng G., “Heuristics for the stochastic/dynamic user-optimal route choice problem”, European Journal of Operational Research, Vol. 126, pp. 13-30, 2000.
[22] Chen H. K., “A combined model with the four travel choices and variable demand,” International Academic Conference on Social Sciences, Istanbul, Turkey, 2013
[23] Chen H. K., “Issues in Travel Demand Forecasting”, International Journal of Social, Management, Economics and Business Engineering, Vol. 8, pp. 1936-1940, 2014.
[24] Chen H. K., “A new (two-objective) model formulation for the entropy-based traffic assignment problem”, The 27th European Conference on Operational Research, Glasgow, UK, 2015a.
[25] Chen H. K., “A heuristic for the doubly constrained entropy distribution/ assignment problem”, Network and Spatial Economic, 2015b (submitted).
[26] Chen H.K., “A heuristic solution algorithm for the combined model of the four travel choice with variable demand”, Proceeding of EASTS, Cebu, Philippines, 2015c (accepted).
[27] Dafermos S. C. and Sparrow F. T., “The traffic assignment problem for a general network”, Journal of Research of the National Bureau of Standards: Series B, Vol. 73, pp. 91-118, 1969.
[28] Dial R. B., “A probabilistic multipath traffic assignment model which obviates path enumeration”, Transportation research, Vol. 5, pp. 83-111, 1971.
[29] Dial R. B., “A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration”, Transportation Research Part B: Methodological, Vol. 40, pp. 917-936, 2006.
[30] Evans S. P., “Derivation and analysis of some models for combining trip distribution and assignment”, Transportation Research, Vol. 10, pp. 37-57, 1976.
[31] Fisk C., “Some developments in equilibrium traffic assignment”, Transportation Research Part B: Methodological, Vol. 14, pp. 243-255, 1980.
[32] Florian M., Guálat J. and Spiess H., “An efficient implementation of the ‘PARTAN’ variant of the linear approximation method for the network equilibrium problem”, Networks, Vol. 17, pp. 319-339, 1987.
[33] Florian M., Constantin I. and Florian D., “A new look at projected gradient method for equilibrium assignment”, Transportation Research Record: Journal of the Transportation Research Board, Vol. 2090, pp. 10-16, 2009.
[34] Florian M. and Morosan C. D., “On uniqueness and proportionality in multi-class equilibrium assignment”, Transportation Research Part B: Methodological, Vol. 70, pp. 173-185, 2014.
[35] Frank M., and Wolfe P., “An algorithm for quadratic programming”, Naval research logistics quarterly, Vol. 3, pp. 95-110, 1956.
[36] Gallager R. G., “Loops in multi-commodity flows”, In Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, pp. 819-825, New Orleans, USA, 1977.
[37] Gentile G. and Noekel K., “Linear user cost equilibrium: the new algorithm for traffic assignment in VISUM”, In European Transport Conference, Netherlands, 2009.
[38] Harris B., “Multiple paths through a network”, In 42nd Congress of the European Regional Science Association, Dortmund, Germany, 2002.
[39] Janson B. N. and Zozaya-Gorostiza C., “The problem of cyclic flows in traffic assignment”, Transportation Research Part B: Methodological, Vol. 21, pp. 299-310, 1987.
[40] Janson B. N., “Most likely origin-destination link uses from equilibrium assignment”, Transportation Research Part B: Methodological, Vol. 27, pp. 333-350, 1993.
[41] Jayakrishnan R., Tsai W. T., Prashker J. N. and Rajadhyaksha S., “A faster path-based algorithm for traffic assignment”, University of California Transportation Center, 1994.
[42] Kumar A. and Peeta S., “Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem”, Transportation Research Part B: Methodological, Vol. 71, pp. 213-229, 2015.
[43] Larsson T. and Patriksson M., “Simplicial decomposition with disaggregated representation for the traffic assignment problem”, Transportation Science, Vol. 26, pp. 4-17, 1992.
[44] Larsson T., Lundgren J. T., Rydergren C. and Patriksson M., “Most likely traffic equilibrium route flows analysis and computation”, In Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models, Giannessi F., Maugeri A. and Pardalos P. M., Springer, US, 2004.
[45] LeBlanc L. J., Morlok E. K. and Pierskalla W. P., “An efficient approach to solving the road network equilibrium traffic assignment problem”, Transportation Research, Vol. 9, pp. 309-318, 1975.
[46] LeBlanc L. J., Helgason R. V. and Boyce D. E., “Improved efficiency of the Frank-Wolfe algorithm for convex network programs”, Transportation Science, Vol. 19, pp. 445-462, 1985.
[47] Luenberger D. G., Introduction to linear and nonlinear programming, Addison-Wesley, Massachusetts, 1973.
[48] Leung Y. and Yan J., “A note on the fluctuation of flows under the entropy principle”, Transportation Research Part B: Methodological, Vol. 31, pp. 417-423, 1997.
[49] Lu S. and Nie Y., “Stability of user-equilibrium route flow solutions for the traffic assignment problem”, Transportation Research Part B: Methodological, Vol. 44, pp. 609- 617, 2010.
[50] Nguyen S., “An algorithm for the traffic assignment problem”, Transportation Science, Vol. 8, pp. 203-216, 1974.
[51] Nguyen S. and Dupuis C., “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs”, Transportation Science, Vol. 18, pp. 185-202, 1984.
[52] Nie Y. M., “A class of bush-based algorithms for the traffic assignment problem”, Transportation Research Part B: Methodological, Vol. 44, pp. 73-89, 2010.
[53] Nie Y. M., “A note on Bar-Gera′s algorithm for the origin-based traffic assignment problem”, Transportation Science, Vol. 46, pp. 27-38, 2012.
[54] Patriksson M., The Traffic Assignment Problem: Models and Methods, VSP, Utrecht, 1994.
[55] Rossi T. F., McNeil S. and Hendrickson C., “Entropy model for consistent impact-fee assessment”, Journal of Urban Planning and Development, Vol. 115, pp. 51-63, 1989.
[56] Schneur R.R., “Scaling algorithms for multicommodity flow problems and network flow problems with side constraints”, Massachusetts Institute of Technology, Ph.D. Thesis, 1991.
[57] Sheffi Y., Urban transportation networks: equilibrium analysis with mathematical programming methods, Prentice-Hall, Inc., New Jersey, 1985.
[58] Slavin H., Brandon J. and Rabinowicz A. “An empirical comparison of alternative user equilibrium traffic assignment methods”, In Proceedings of the European Transport Conference, Strasbourg, France, 2006.
[59] Sun C., Cheng L. and Xu T., “Range of User-equilibrium Route Flow with Applications”, Procedia-Social and Behavioral Sciences, Vol. 138, pp. 86-96, 2014.
[60] Wardrop J. G., “Some theoretical aspects of road traffic research”, In ICE Proceedings: Engineering Divisions, Vol. 1, pp. 325-362, Thomas Telford, 1952.
[61] Wilson A. G., Entropy in urban and regional modelling, Pion Ltd, 1970.
[62] Wilson A. G., “Entropy in Urban and Regional Modelling: Retrospect and Prospect”, Geographical Analysis, Vol. 42, pp. 364-394, 2010.
[63] Xie J. and Xie C., “An improved TAPAS algorithm for the traffic assignment problem”, pp. 2336-2341, Intelligent Transportation Systems (ITSC), IEEE 17th International Conference on. IEEE, Qingdao, China, 2014.
[64] Xie J. and Xie C., “Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance”, Transportation Research Board 94th Annual Meeting, Washington, D.C., USA, 2015.
[65] Xiong Q., “Comparison of user-optimal and system-optimal traffic assignments for the Chicago regional road network”, University of Illinois at Chicago, Ph.D. Thesis, 2002.
[66] Zheng H., “Adaptation of network simplex for the Traffic Assignment Problem”, Transportation Science, 2015 (accepted).
|