Selection of the Street Expansion Projects in Urban Transportation Network

Document Type : Scientific - Research

Authors

1 MSC. Grad., Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran

2 Assistant Professor, Department of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran

Abstract

One of the issues within the field of transportation is the selection of the transportation investment projects amongst which the selection of the projects dealing with the construction of the new streets or the expansion of the existing streets is of great interest. Although much research has been dedicated to the above-mentioned area, none has solely focused upon the expansion of the streets existing within the urban transportation network. The prime objective of the current study is to select a set of streets within the urban transportation network to enable the expansion purposes (e.g. in terms of budget constraint) as well as to optimize the travel time within the network.To fulfill the aforementioned goal, a mathematical model for the selection of projects within the urban network is proposed for the situations in which merely the expansion of the existing streets is required. Then, an innovative algorithm is introduced to determine the set of candidate streets for expansion purposes. Since the problem of project selection within the urban transportation system is an NP-hard problem from the solution perspective, with one of its most time demanding components being the solution of the traffic assignment sub-problem, and given that the expansion of the existing streets does not change the body and topology of the base network, an innovative algorithm is proposed to solve the traffic assignment problem in this situation, followed by the particle swarm optimization meta heuristic algorithm to solve the project selection model. 

Keywords

References

-Farahani, R. Z., Miandoabchi, E., Szeto, W. Y. and Rashidi, H. (2013) "A review of urban transportation network design problems", European Journal of Operational Research ,Vol. 229, no. 2, pp. 281–302.
-Farvaresh, H., Sepehri, M.M. (2012) "A single-level mixed integer linear formulation for a bi-level discrete network design problem", Transportation Research Part E: Logistics and Transportation Review, Vol. 47, No. 5, pp.623–640.
-Frank, M. and Wolfe, P. (1956) "An algorithm for quadratic programming", Nav. Res. Logist. Q., Vol. 3, No. 1–2, pp. 95–110.
-Gallo, M., D'Acierno, L. and Montella, B. (2010) "A meta-heuristic approach for solving the urban network design problem", European Journal of Operational Research, Vol. 201No. 1, pp.144–157.
-Hosseininasab, S. and Shetab-Boushehri, S. (2015) "Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem", European Journal of Operational Research, Vol. 246, pp. 762–771.
-Karimi, H., Rezvan, M.T., Shirmohammadi, A. and Vallée, D. (2013) "A solution for urban road selection and construction problem using simulation and goal programming - Case study of the city of Isfahan", Transport Policy, Vol. 29, pp. 46–53.
-Kennedy, J. and Eberhart, R. C. (1997) "A Discrete Binary Version Of The Particle Swarm Algorithm", IEEE International Conference on Computational Cyberneticsa nd Simulatio.
-Luathep, P., Sumalee, A., Lam, W. H. K., Li, Z. C. and Lo, H. K. (2011) "Global optimization method for mixed transportation network design problem: a mixed-integer linear programming approach", Transportation Research Part B: Methodological, Vol. 45, No. 5, pp. 808–827.
-Miandoabchi, E., Daneshzand, F., Farahani,R. Z. and Szeto,W.Y. (2015) "Time-dependent discrete road network design with both tactical and strategic decisions", Journal of the Operational Research Society ,Vol. 66, pp. 894–913.
-Miandoabchi, M. and Zanjirani Farahani, R., (2011) "Optimizing reserve capacity of urban road networks in a discrete network design problem", Advances in Engineering Software Vol. 42, pp.1041–1050.
-Xu, T., Wei, H. and Hu, G. (2009) "Study on continuous network design problem using simulated annealing and genetic algorithm", Expert Systems with Applications, Vol. 36, No.2, Part 1,pp. 1322–1328
-Yang, H. and Zhou, J. (1998) "Optimal traffic counting locations for origin–destination matrix estimation", Transportation Research Part B: Methodological, Vol. 32, No. 2, pp. 109–126.

Files

History

  • Receive Date: 03 December 2015
  • Revise Date: 04 March 2016
  • Accept Date: 19 September 2016

Share

How to cite

Statistics