Abstract
Extensive research has been carried out on the traffic assignment problem over the past few years, as it has important applications in intelligent transportation systems. In this paper, a random multidimensional mutation particle swarm optimization algorithm (RMMPSO) is proposed for solving traffic assignment problem. Besides, a segmented impedance function (SIF) model is proposed for solving the problem that the traditional BPR function is not suited for the saturated road network. Furthermore, the proposed RMMPSO and SIF are applied to a traffic assignment network. Numerical experiments show that the proposed algorithm is effective and efficient for the traffic assignment problem, and the SIF model can greatly reduce the overflow state in the road network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beckman, M.J., McGuire, C.B., Winsten, C.B.: Studies in the economics of transportation. Yale University Press, New Haven (1956)
Bowman, M., Briand, L.C., Labiche, Y.: Solving the class responsibility assignment problem in object-oriented analysis with multi-objective genetic algorithms. IEEE Transcations on Software Engineering 36(6), 817–837 (2010)
D’Acierno, L., Gallo, M., Montella, B.: An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem. European Journal of Operational Research 217(2), 459–4697 (2012)
Huang, H., Qin, H., Hao, Z.F., et al.: Example-based learning particle swarm optimization for continuous optimization. Information Sciences 182(1), 125–138 (2012)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 942–1948. IEEE Press, Piscataway (1995)
Lin, S.Y., Horng, S.J., Kaoe, T.W., et al.: An efficient bi-objective personnel assignment algo-rithm based on a hybrid particle swarm optimization model. Expert Systems with Applications 37(12), 7825–7830 (2010)
Monoyios, D., Vlachos, K.: Multiobjective genetic algorithms for solving the impairment-aware routing and wavelength assignment problem. Journal of Optical Communications and Networking 3(1), 40–47 (2011)
Noel, M.: A new gradient based particle swarm optimization algorithm for accurate computation of global minimum. Applied Soft Computing 12(1), 353–359 (2012)
Patriksson, M.: The traffic assignment problem, models and methods, VSP, BV, Utrecht, The Netherlands (1994)
Peeta, S., Ziliaskopoulos, A.: Fundamentals of dynamic traffic assignment: the past, the present and the future. Networks and Spatial Economics 1-2, 201–230 (2001)
Shahpar, A.H., Aashtiani, H.Z., Babazadeh, A.: Dynamic penalty function method for the side constrained traffic assignment problem. Applied Mathematics and Computation 206, 332–345 (2008)
Wang, W.: Practical speed-flow relationship model of highway traffic-flow. Journal of Southeast University (Natural Science Edition) 33(4), 487–491 (2003)
Zheng, Y., Du, Y.C., Sun, L.: Considerations on Problems in the BPR Function. Traffic & Transportation (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Hongwei, G., Qiaoxia, Z., Fan, W. (2012). Solving Traffic Assignment Problem by an Improved Particle Swarm Optimization and a Segmented Impedance Function. In: Park, J., Kim, J., Zou, D., Lee, Y. (eds) Information Technology Convergence, Secure and Trust Computing, and Data Management. Lecture Notes in Electrical Engineering, vol 180. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5083-8_12
Download citation
DOI: https://doi.org/10.1007/978-94-007-5083-8_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5082-1
Online ISBN: 978-94-007-5083-8
eBook Packages: EngineeringEngineering (R0)