Two-way road network design problem with variable lanes

Abstract

This paper studies a new form of transportation network design problem. In urban transportation network, unreasonable phenomenon can occur in certain traffic period (e.g. on/off duty period), which demonstrates that the flows of opposite directions on a two-way road are seriously asymmetric; one traffic link of a two-way road congest heavily but the other is hardly used. In order to reduce transportation congestion and make full use of the existing road resources, we propose a lane reallocating approach in peak period, and establish a discrete bi-level programming model for the decision-making. Then, based on particle swarm optimization (PSO) technique, a heuristic solution algorithm for the bi-level model is designed. Finally, the lane reallocating approach is demonstrated through a simple transportation network.

Keywords

transportation network design problem / lane reallocating / bi-level programming / particle swarm optimization

References

[1] Ceylan H., Bell M.G.H.. Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion. Transportation Research-B, 2005, 39: 169-185.

[2] Chen M.Y., Alfa A.S.. Algorithms for solving Fisk’s stochastic traffic assignment model. Transportation Research-B, 1991, 25: 405-412.

[3] Chen M.Y., Alfa A.S.. A network design algorithm using a stochastic incremental traffic assignment approach. Transportation Science, 1991, 25(3): 215-224.

[4] Fisk C.. Some developments in equilibrium traffic assignment problem. Transportation Research-B, 1980, 14: 243-255.

[5] Gao Z.Y., Sun H.J., Shan L.L.. A continuous equilibrium network design model and its solution algorithm for transit system. Transportation Research-B, 2004, 38: 235-250.

[6] Gao Z.Y., Wu J.J., Sun H.J.. Solution algorithm for the bi-level discrete network design problem. Transportation Research-B, 2005, 39: 479-495.

[7] Huang H.J., Bell M.G.H., Wang S.Y.. A bi-level formulation and quasi-Newton algorithm for stochastic equilibrium network design problem with elastic demand. Journal of Systems Science and Complexity, 2001, 14: 40-53.

[8] Kennedy J., Eberhart R.C.. Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks, Perth, Australia, 1995, Piscataway, NJ: IEEE Service Center 1942-1948.

[9] Kennedy J., Eberhart R.C.. Swarm Intelligence, 2001, USA: Morgan Kaufmann Publishers

[10] Laskari, E.C., Parsopoulos, K.E. & Vrahatis, M.N. (2002). Particle swarm optimization for integer programming. Proceedings of the IEEE Congress on Evolutionary Computation, Honolulu, USA

[11] LeBlance L.J.. An algorithm for the discrete network design problem. Transportation Science, 1975, 9: 183-199.

[12] Poorzahedy H., Turnquist M.A.. Approximate algorithms for the discrete network design problem. Transportation Research-B, 1982, 16: 45-55.

[13] Schutte, J.F. (2002). Particle swarms in sizing and global optimization, Master’s thesis, University of Pretoria, Department of Mechanical Engineering

[14] Sheffi Y.. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, 1985, Englewood Cliffs, New Jersey: Prentice-Hall, INC

[15] Yang H., Bell M.G.H.. Models and algorithms for road network design: a review and some new developments. Transportation Review, 1998, 18: 257-278.

[16] Yoshida, H., Kawata, K., Fukuyama, Y. & Nakanishi, Y. (1999). A particle swarm optimization for reactive power and voltage control considering voltage stability. IEEE International Conference on Intelligent System Applications to Power Systems (ISAP’99), Rio de Janeiro, April 4–8