Hybrid meta-heuristic algorithm for the simultaneous optimization of the O-D trip matrix estimation

Computer-Aided Civil and Infrastructure Engineering

Volumn 19, Issue 6, 2004, Pages 421-435

  Stathopoulos, Antony ^a   Tsekeris, Theodore ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONVERGENCE RATES; META-HEURISTIC OPTIMIZATION ALGORITHMS; URBAN ROAD NETWORKS;

CIVIL ENGINEERING;

CIVIL ENGINEERING; GENETIC ALGORITHM;

EID: 4344627591     PISSN: 10939687     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2004.00367.x     Document Type: Article

References (30)

1. Beckmann, M. J., McGuire, C. B. & Winsten, C. B. (1956), Studies in the Economics of Transportation, Yale University Press, New Haven, CT.
2. Cascetta, E. & Nguyen, S. (1988), A unified framework for estimating or updating origin/destination matrices from traffic counts, Transportation Research B, 22 (6), 437-55.
3. Chang, S.-O., Park, Y.-H. & Lee, K.-J. (2002), A new method of the evolutionary algorithm for adaptive learning control, in Proceedings of the 15th IFAC Triennial World Congress, Barcelona, Spain, July 21-26.
4. Fisk, C. S. (1988), On combining maximum entropy trip matrix estimation with user optimal assignment, Transportation Research B, 22(1), 69-73.
5. Fisk, C. S. (1989), Trip matrix estimation from link traffic counts: The congested network case, Transportation Research B, 23(5), 331-6.
6. Fisk, C. S. & Boyce, D. E. (1983), A note on trip matrix estimation from link traffic count data, Transportation Research B, 17(3), 245-50.
7. Friesz, T. L., Cho, H.-J., Mehta, N. J., Tobin, R. L. & Anandalingam, G. (1992), A simulated annealing approach to the network design problem with variational inequality constraints, Transportation Science, 26(1), 18-26.
8. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
9. Gong, Z. (1998), Estimating the urban OD matrix: A neural network approach, European Journal of Operational Research, 106, 108-15.
10. Kim, H., Baek, S. & Lim, Y. (2001), Origin-Destination matrices estimated with a genetic algorithm from link traffic counts, Transportation Research Record, 1771, 156-63.
11. Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. (1983), Optimization of simulated annealing, Science, 220, 671-80.
12. Liu, J. (1999), The impact of neighborhood size on the process of simulated annealing: Computational experiments on the flowshop scheduling problem, Computers and Industrial Engineering, 37, 285-8.
13. Lo, H. P., Zhang, N. & Lam, W. H. K. (1999), Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts, Transportation Research B, 33, 369-85.
14. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. & Teller, E. (1953), Equation of state calculations by fast computing machines, Journal of Chemical Physics, 21, 1087-92.
15. Pagano, R. R. (1994), Understanding Statistics in the Behavioral Sciences, Fourth edition, West Publishing Company, St. Paul, MN.
16. Preux, P. & Talbi, E.-G. (1999), Towards hybrid evolutionary algorithms, International Transactions in Operational Research, 6, 557-70.
17. Rudolph, G. (1994), Convergence properties of canonical genetic algorithms, IEEE Transactions on Neural Networks, 5(1), 96-101.
18. Tamin, O. Z. & Willumsen, L. G. (1989), Transport demand model estimation from traffic counts, Transportation, 16, 3-26.
19. Tavana, H. & Mahmassani, H. (2001), Estimation of dynamic origin-destination flows from sensor data using bi-level optimization method, in Proceedings of the 80th Annual Meeting of Transportation Research Board, Washington, DC.
20. Van Vliet, D. & Hall, M. (1985), SATURN 6.1-A User's Manual-Universal Version, The Institute of Transport Studies, University of Leeds, Leeds.
21. Wang, L. & Zheng, D.-Z. (2001), An effective hybrid optimization strategy for job-shop scheduling problems, Computers and Operations Research, 28, 585-96.
22. Wardrop, J. G. (1952), Some theoretical aspects of road traffic research, in Proceedings of the Institution of Civil Engineers, 2(1), 325-78.
23. Washington, S. P., Karlaffis, M. G. & Mannering, F. L. (2003), Statistical and Econometric Methods for Transportation Data Analysis, Chapman and Hall/CRC, Boca Raton, FL.
24. Wu, J. (1997), A real-time origin-destination matrix updating algorithm for on-line applications, Transportation Research B, 31(5), 381-96.
25. Yang, H. (1995), Heuristic algorithms for the bilevel O-D matrix estimation problem, Transportation Research B, 29(4), 231-42.
26. Yang, H. & Bell, M. G. H. (2001), Transport bilevel programming problems: Recent methodological advances, Transportation Research B, 35(1), 1-4.
27. Yang, H., Sasaki, T., Iida, Y. & Asakura, Y. (1992), Estimation of Origin-Destination matrices from link traffic counts on congested networks, Transportation Research B, 26(6), 417-34.
28. Yin, Y. (2000), Genetic-algorithms-based approach for bi-level programming models, ASCE Journal of Transportation Engineering, 126(2), 115-20.
29. Youssef, H., Sait, S. M. & Adiche, H. (2001), Evolutionary algorithms, simulated annealing and tabu search: A comparative study, Engineering Applications of Artificial Intelligence, 14(2), 167-81.
30. Zhang, X. & Maher, M. (1998), An algorithm for the solution of bi-level programming problems in transport network analysis, in J. D. Griffiths (ed.), Mathematics in Transport Planning and Control, Pergamon, Oxford, pp. 177-86.