Table of Contents Author Guidelines Submit a Manuscript
Journal of Advanced Transportation
Volume 2018, Article ID 2738930, 18 pages
https://doi.org/10.1155/2018/2738930
Research Article

Time-Dependent Transportation Network Design considering Construction Impact

1Department of Civil and Environmental Engineering, Utah State University, Logan, UT 84322, USA
2Institute of Transportation Engineering, Zhejiang University, Hangzhou, Zhejiang 310058, China

Correspondence should be addressed to Lihui Zhang; nc.ude.ujz@gnahziuhil

Received 21 August 2017; Revised 27 November 2017; Accepted 12 December 2017; Published 15 January 2018

Academic Editor: Martin Trépanier

Copyright © 2018 Yi He et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Schrank, B. Eisele, T. Lomax, and J. Bak, Urban mobility scorecard, 2015.
  2. T. L. Friesz, D. Bernstein, N. J. Mehta, R. L. Tobin, and S. Ganjalizadeh, “Day-to-day dynamic network disequilibria and idealized traveler information systems,” Operations Research, vol. 42, no. 6, pp. 1120–1136, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. T. L. Friesz, D. Bernstein, and R. Stough, “Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows,” Transportation Science, vol. 30, no. 1, pp. 14–31, 1996. View at Publisher · View at Google Scholar · View at Scopus
  4. H. K. Lo and W. Y. Szeto, “Planning transport network improvements over time,” Urban and Regional Transportation Modeling: Essays in Honor of David Boyce, pp. 157–176, 2004. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Abdulaal and L. J. LeBlanc, “Continuous equilibrium network design models,” Transportation Research Part B: Methodological, vol. 13, no. 1, pp. 19–32, 1979. View at Publisher · View at Google Scholar · View at Scopus
  6. G. B. Dantzig, R. P. Harvey, Z. F. Lansdowne, D. W. Robinson, and S. F. Maier, “Formulating and solving the network design problem by decomposition,” Transportation Research Part B: Methodological, vol. 13, no. 1, pp. 5–17, 1979. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Z. Aashtiani and T. L. Magnanti, “Equilibria on a congested transportation network,” Society for Industrial and Applied Mathematics. Journal on Algebraic and Discrete Methods, vol. 2, no. 3, pp. 213–226, 1981. View at Google Scholar · View at MathSciNet
  8. C. Suwansirikul, T. L. Friesz, and R. L. Tobin, “Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problem,” Transportation Science, vol. 21, no. 4, pp. 254–263, 1987. View at Publisher · View at Google Scholar · View at Scopus
  9. T. L. Friesz, H.-J. Cho, N. J. Mehta, R. L. Tobin, and G. Anandalingam, “Simulated annealing approach to the network design problem with variational inequality constraints,” Transportation Science, vol. 26, no. 1, pp. 18–26, 1992. View at Publisher · View at Google Scholar · View at Scopus
  10. Q. Meng, H. Yang, and M. G. H. Bell, “An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem,” Transportation Research Part B: Methodological, vol. 35, no. 1, pp. 83–105, 2001. View at Publisher · View at Google Scholar · View at Scopus
  11. Q. Meng and H. Yang, “Benefit distribution and equity in road network design,” Transportation Research Part B: Methodological, vol. 36, no. 1, pp. 19–35, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. D. H. Lee, “Planning Transport Network Improvements over Time,” in Urban and Regional Transportation Modeling: Essays in Honor of David Boyce, Edward Elgar Publishing, Inc., USA, 2004. View at Google Scholar
  13. Y. Yin and S. Lawphongpanich, “A robust approach to continuous network designs with demand uncertainty,” Transportation and Traffic Theory, pp. 110–126, 2007. View at Google Scholar
  14. P. A. Steenbrink, “Transport network optimization in the Dutch integral transportation study,” Transportation Research, vol. 8, no. 1, pp. 11–27, 1974. View at Publisher · View at Google Scholar · View at Scopus
  15. L. J. Leblanc, “An algorithm for the discrete network design problem,” Transportation Science, vol. 9, no. 3, pp. 183–199, 1975. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Chen and A. S. Alfa, “A network design algorithm using a stochastic incremental traffic assignment approach,” Transportation Science, vol. 25, no. 3, pp. 215–224, 1991. View at Publisher · View at Google Scholar · View at Scopus
  17. C. Lee and K. Yang, “Network design of one‐way streets with simulated annealing,” Papers in Regional Science, vol. 73, no. 2, pp. 119–134, 1994. View at Publisher · View at Google Scholar · View at Scopus
  18. Z. Drezner and G. O. Wesolowsky, “Selecting an optimum configuration of one-way and two-way routes,” Transportation Science, vol. 31, no. 4, pp. 386–394, 1997. View at Publisher · View at Google Scholar · View at Scopus
  19. Z. Drezner and G. O. Wesolowsky, “Network design: selection and design of links and facility location,” Transportation Research Part A: Policy and Practice, vol. 37, no. 3, pp. 241–256, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. H. Poorzahedy and F. Abulghasemi, “Application of Ant System to network design problem,” Transportation, vol. 32, no. 3, pp. 251–273, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. Z. Gao, J. Wu, and H. Sun, “Solution algorithm for the bi-level discrete network design problem,” Transportation Research Part B: Methodological, vol. 39, no. 6, pp. 479–495, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. Q. Meng and H. L. Khoo, “Optimizing contraflow scheduling problem: Model and algorithm,” Journal of Intelligent Transportation Systems: Technology, Planning, and Operations, vol. 12, no. 3, pp. 126–138, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. G. E. Cantarella, G. Pavone, and A. Vitetta, “Heuristics for urban road network design: lane layout and signal settings,” European Journal of Operational Research, vol. 175, no. 3, pp. 1682–1695, 2006. View at Publisher · View at Google Scholar · View at Scopus
  24. G. E. Cantarella and A. Vitetta, “The multi-criteria road network design problem in an urban area,” Transportation, vol. 33, no. 6, pp. 567–588, 2006. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Gallo, L. D'Acierno, and B. Montella, “A meta-heuristic approach for solving the urban network design problem,” European Journal of Operational Research, vol. 201, no. 1, pp. 144–157, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. P. Luathep, A. Sumalee, W. H. K. Lam, Z. Li, and H. K. Lo, “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, 2011. View at Publisher · View at Google Scholar · View at Scopus
  27. Z. X. Wu, W. H. K. Lam, and K. S. Chan, “Multi-model network design: Selection of pedestrianisation location,” Journal of Eastern Asia Society for Transportation Studies, vol. 6, pp. 2275–2290, 2005. View at Google Scholar
  28. Z. Song, Y. Yin, and S. Lawphongpanich, “Optimal Deployment of Managed Lanes in General Networks,” International Journal of Sustainable Transportation, vol. 9, no. 6, pp. 431–441, 2015. View at Publisher · View at Google Scholar · View at Scopus
  29. E. Miandoabchi and R. Z. Farahani, “Optimizing reserve capacity of urban road networks in a discrete Network Design Problem,” Advances in Engineering Software, vol. 42, no. 12, pp. 1041–1050, 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. H. Poorzahedy and M. A. Turnquist, “Approximate algorithms for the discrete network design problem,” Transportation Research Part B: Methodological, vol. 16, no. 1, pp. 45–55, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. R. S. Solanki, J. K. Gorti, and F. Southworth, “Using decomposition in large-scale highway network design with a quasi-optimization heuristic,” Transportation Research Part B: Methodological, vol. 33, no. 2, pp. 127–140, 1998. View at Google Scholar · View at Scopus
  32. H. Poorzahedy and O. M. Rouhani, “Hybrid meta-heuristic algorithms for solving network design problem,” European Journal of Operational Research, vol. 182, no. 2, pp. 578–596, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. Y. Yin, “Genetic-algorithms-based approach for bilevel programming models,” Journal of Transportation Engineering, vol. 126, no. 2, pp. 115–119, 2000. View at Publisher · View at Google Scholar · View at Scopus
  34. K. Jeon, J. S. Lee, S. Ukkusuri, and S. T. Waller, “Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem,” Transportation Research Record, no. 1964, pp. 91–103, 2006. View at Google Scholar · View at Scopus
  35. L. Zhang, S. Lawphongpanich, and Y. Yin, “An active-set algorithm for discrete network design problems,” Transportation and Traffic Theory, pp. 283–300, 2009. View at Google Scholar
  36. H. Farvaresh and M. M. Sepehri, “A branch and bound algorithm for bi-level discrete network design problem,” Networks and Spatial Economics, vol. 13, no. 1, pp. 67–106, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. T. L. Friesz and S. Shah, “An overview of nontraditional formulations of static and dynamic equilibrium network design,” Transportation Research Part B: Methodological, vol. 35, no. 1, pp. 5–21, 2001. View at Publisher · View at Google Scholar · View at Scopus
  38. W. Y. Szeto and H. K. Lo, “Transportation network improvement and tolling strategies: the issue of intergeneration equity,” Transportation Research Part A: Policy and Practice, vol. 40, no. 3, pp. 227–243, 2006. View at Publisher · View at Google Scholar · View at Scopus
  39. W. Y. Szeto and H. K. Lo, “Time-dependent transport network improvement and tolling strategies,” Transportation Research Part A: Policy and Practice, vol. 42, no. 2, pp. 376–391, 2008. View at Publisher · View at Google Scholar · View at Scopus
  40. O. Liam and Y. W. Szeto, “The discrete network design problem over time,” HKIE Transactions, vol. 14, no. 4, pp. 47–55, 2007. View at Google Scholar
  41. H. Lo and W. Y. Szeto, “Time-dependent transport network design: a study on budget sensitivity,” Journal of the Eastern Asia Society for Transportation Studies, vol. 5, 2003. View at Google Scholar
  42. W. Y. Szeto and H. K. Lo, “Strategies for road network design over time: Robustness under uncertainty,” Transportmetrica, vol. 1, no. 1, pp. 47–63, 2005. View at Publisher · View at Google Scholar · View at Scopus
  43. H. K. Lo and W. Y. Szeto, “Time-dependent transport network design under cost-recovery,” Transportation Research Part B: Methodological, vol. 43, no. 1, pp. 142–158, 2009. View at Publisher · View at Google Scholar · View at Scopus
  44. W. Y. Szeto, X. Jaber, and M. O'Mahony, “Time-dependent discrete network design frameworks considering land use,” Computer-Aided Civil and Infrastructure Engineering, vol. 25, no. 6, pp. 411–426, 2010. View at Publisher · View at Google Scholar · View at Scopus
  45. W. Y. Szeto, Y. Jiang, D. Z. Wang, and A. Sumalee, “A sustainable road network design problem with land use transportation interaction over time,” Networks and Spatial Economics, vol. 15, no. 3, pp. 791–822, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. Y. Jiang and W. Y. Szeto, “Time-dependent transportation network design that considers health cost,” Transportmetrica A: Transport Science, vol. 11, no. 1, pp. 74–101, 2015. View at Publisher · View at Google Scholar · View at Scopus
  47. E. Miandoabchi, F. Daneshzand, R. Zanjirani Farahani, and W. Y. Szeto, “Time-dependent discrete road network design with both tactical and strategic decisions,” Journal of the Operational Research Society, vol. 66, no. 6, pp. 894–913, 2015. View at Publisher · View at Google Scholar · View at Scopus
  48. B. J. Kim, W. Kim, and B. H. Song, “Sequencing and scheduling highway network expansion using a discrete network design model,” Annals of Regional Science, vol. 42, no. 3, pp. 621–642, 2008. View at Publisher · View at Google Scholar · View at Scopus
  49. S. V. Ukkusuri and G. Patil, “Multi-period transportation network design under demand uncertainty,” Transportation Research Part B: Methodological, vol. 43, no. 6, pp. 625–642, 2009. View at Publisher · View at Google Scholar · View at Scopus
  50. S.-M. Hosseininasab and S.-N. Shetab-Boushehri, “Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem,” European Journal of Operational Research, vol. 246, no. 3, pp. 762–771, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. J. Wardrop, “Some theoretical aspects of road traffic research,” ICE Proceedings: Engineering Divisions, vol. 1, no. 3, pp. 325–362, 1952. View at Google Scholar
  52. R. K. Ahuja, T. L. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993. View at MathSciNet
  53. H. Scheel and S. Scholtes, “Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity,” Mathematics of Operations Research, vol. 25, no. 1, pp. 1–22, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  54. G. Bouza and G. Still, “Mathematical programs with complementarity constraints: convergence properties of a smoothing method,” Mathematics of Operations Research, vol. 32, no. 2, pp. 467–483, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  55. A. U. Raghunathan and L. T. Biegler, “An interior point method for mathematical programs with complementarity constraints ({MPCC}s),” SIAM Journal on Optimization, vol. 15, no. 3, pp. 720–750, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  56. F. Facchinei and J.-S. Pang, Finite-dimensional variational inequalities and complementarity problems. Vol. I, Springer Series in Operations Research, Springer-Verlag, NY, USA, 2003. View at MathSciNet
  57. A. S. Drud, “CONOPT—A Large-Scale GRG Code,” ORSA Journal on Computing, vol. 6, no. 2, pp. 207–216, 1994. View at Publisher · View at Google Scholar
  58. S. Nguyen and C. Dupuis, “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs,” Transportation Science, vol. 18, no. 2, pp. 185–202, 1984. View at Publisher · View at Google Scholar · View at Scopus
  59. R. E. Rosenthal, GAMS-A User's Guide, GAMS Development Corporation, Washington, DC, USA, 2012.