Skip to main content
Erschienen in: Transportation 1/2020

13.01.2018

A model for multi-class road network recovery scheduling of regional road networks

verfasst von: Arash Kaviani, Russell G. Thompson, Abbas Rajabifard, Majid Sarvi

Erschienen in: Transportation | Ausgabe 1/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, an optimisation model for recovery planning of road networks is presented in which both social and economic resilience is aimed to be achieved. The model is formulated as a bi-level multi-objective discrete network design problem which forms a non-convex mixed integer non-linear problem. Solved by a Branch and Bound method, the solution algorithm employs an outer approximation method to estimate the lower bound of each node in the Branch and Bound search tree. The solution algorithm exploits a unique approach for lower-bound computation dealing with a disrupted multi-class network that may not be able to satisfy the demand between all OD pairs due to damaged links. The model is assessed by applying it on the Sioux Falls network. It is also illustrated how the Pareto-optimal solutions achieved by the multi-objective optimisation can vary depending on the emphasis placed on different classes of vehicles.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Abdulaal, M., LeBlanc, L.J.: Continuous equilibrium network design models. Transp. Res. Part B Methodol. 13(1), 19–32 (1979)CrossRef Abdulaal, M., LeBlanc, L.J.: Continuous equilibrium network design models. Transp. Res. Part B Methodol. 13(1), 19–32 (1979)CrossRef
Zurück zum Zitat Brusco, M.J., Stahl, S.: Branch-and-Bound Applications in Combinatorial Data Analysis. Springer, Berlin (2006) Brusco, M.J., Stahl, S.: Branch-and-Bound Applications in Combinatorial Data Analysis. Springer, Berlin (2006)
Zurück zum Zitat Bye, P.: A Pre-event Recovery Planning Guide for Transportation, vol. 753. Transportation Research Board, Washington (2013)CrossRef Bye, P.: A Pre-event Recovery Planning Guide for Transportation, vol. 753. Transportation Research Board, Washington (2013)CrossRef
Zurück zum Zitat Chen, Y., Tzeng, G.: A fuzzy multi-objective model for reconstructing post-earthquake road-network by genetic algorithm. Int. J. Fuzzy Syst. 1(2), 85–95 (1999) Chen, Y., Tzeng, G.: A fuzzy multi-objective model for reconstructing post-earthquake road-network by genetic algorithm. Int. J. Fuzzy Syst. 1(2), 85–95 (1999)
Zurück zum Zitat Dantzig, G.B., Harvey, R.P., Lansdowne, Z.F., Robinson, D.W., Maier, S.F.: Formulating and solving the network design problem by decomposition. Transp. Res. Part B Methodol. 13(1), 5–17 (1979)CrossRef Dantzig, G.B., Harvey, R.P., Lansdowne, Z.F., Robinson, D.W., Maier, S.F.: Formulating and solving the network design problem by decomposition. Transp. Res. Part B Methodol. 13(1), 5–17 (1979)CrossRef
Zurück zum Zitat Drezner, Z., Salhi, S.: Using hybrid metaheuristics for the one-way and two-way network design problem. Nav. Res. Logist. (NRL) 49(5), 449–463 (2002)CrossRef Drezner, Z., Salhi, S.: Using hybrid metaheuristics for the one-way and two-way network design problem. Nav. Res. Logist. (NRL) 49(5), 449–463 (2002)CrossRef
Zurück zum Zitat Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307–339 (1986)CrossRef Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307–339 (1986)CrossRef
Zurück zum Zitat Farvaresh, H., Sepehri, M.M.: A branch and bound algorithm for bi-level discrete network design problem. Netw. Spat. Econ. 13(1), 67–106 (2013)CrossRef Farvaresh, H., Sepehri, M.M.: A branch and bound algorithm for bi-level discrete network design problem. Netw. Spat. Econ. 13(1), 67–106 (2013)CrossRef
Zurück zum Zitat Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1–3), 327–349 (1994)CrossRef Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1–3), 327–349 (1994)CrossRef
Zurück zum Zitat Florian, M.: A traffic equilibrium model of travel by car and public transit modes. Transp. Sci. 11(2), 166–179 (1977)CrossRef Florian, M.: A traffic equilibrium model of travel by car and public transit modes. Transp. Sci. 11(2), 166–179 (1977)CrossRef
Zurück zum Zitat Fontaine, P., Minner, S.: Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transp. Res. Part B Methodol. 70, 163–172 (2014)CrossRef Fontaine, P., Minner, S.: Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transp. Res. Part B Methodol. 70, 163–172 (2014)CrossRef
Zurück zum Zitat Fontaine, P., Minner, S.: A dynamic discrete network design problem for maintenance planning in traffic networks. Ann. Oper. Res. 253, 1–16 (2016)CrossRef Fontaine, P., Minner, S.: A dynamic discrete network design problem for maintenance planning in traffic networks. Ann. Oper. Res. 253, 1–16 (2016)CrossRef
Zurück zum Zitat Gao, Z., Wu, J., Sun, H.: Solution algorithm for the bi-level discrete network design problem. Transp. Res. Part B Methodol. 39(6), 479–495 (2005)CrossRef Gao, Z., Wu, J., Sun, H.: Solution algorithm for the bi-level discrete network design problem. Transp. Res. Part B Methodol. 39(6), 479–495 (2005)CrossRef
Zurück zum Zitat Gibbons, R.: Game Theory for Applied Economists. Princeton University Press, Princeton (1992)CrossRef Gibbons, R.: Game Theory for Applied Economists. Princeton University Press, Princeton (1992)CrossRef
Zurück zum Zitat Haghani, A.E., Daskin, M.S.: Network design application of an extraction algorithm for network aggregation. Transp. Res. Record 944, 37–46 (1983) Haghani, A.E., Daskin, M.S.: Network design application of an extraction algorithm for network aggregation. Transp. Res. Record 944, 37–46 (1983)
Zurück zum Zitat Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219–260 (2011)CrossRef Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219–260 (2011)CrossRef
Zurück zum Zitat Hart, W.E., Laird, C.D., Watson, J.-P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo–Optimization Modeling in Python, 2nd edn. Springer, Berlin (2017)CrossRef Hart, W.E., Laird, C.D., Watson, J.-P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., Siirola, J.D.: Pyomo–Optimization Modeling in Python, 2nd edn. Springer, Berlin (2017)CrossRef
Zurück zum Zitat Howitt, A.M., Leonard, H.B.: Managing Crises: Responses to Large-scale Emergencies. CQ Press, Washington (2009) Howitt, A.M., Leonard, H.B.: Managing Crises: Responses to Large-scale Emergencies. CQ Press, Washington (2009)
Zurück zum Zitat Karoonsoontawong, A., Waller, S.: Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches. Transp. Res. Rec. J. Transp. Res. Board 2006, 104–117 (1964) Karoonsoontawong, A., Waller, S.: Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches. Transp. Res. Rec. J. Transp. Res. Board 2006, 104–117 (1964)
Zurück zum Zitat Kaviani, A., Thompson, R.G., Rajabifard, A., Griffin, G., Chen, Y.: A decision support system for improving the management of traffic networks during disasters. In: 37th Australasian Transport Research Forum (ATRF), Sydney, New South Wales, Australia (2015) Kaviani, A., Thompson, R.G., Rajabifard, A., Griffin, G., Chen, Y.: A decision support system for improving the management of traffic networks during disasters. In: 37th Australasian Transport Research Forum (ATRF), Sydney, New South Wales, Australia (2015)
Zurück zum Zitat Kaviani, A., Thompson, R.G., Rajabifard, A., Sarvi, M., Yeganeh, B.: Modelling diversion plans during extensive disruptive events. In: 38th Australasian transport research forum (ATRF), Melbourne, Victoria, Australia (2016a) Kaviani, A., Thompson, R.G., Rajabifard, A., Sarvi, M., Yeganeh, B.: Modelling diversion plans during extensive disruptive events. In: 38th Australasian transport research forum (ATRF), Melbourne, Victoria, Australia (2016a)
Zurück zum Zitat Kaviani, A., Thompson, R.G., Rajabifard, A.: Improving regional road network resilience by optimized traffic guidance. Transp. A Transp. Sci. 13, 1–33 (2016b) Kaviani, A., Thompson, R.G., Rajabifard, A.: Improving regional road network resilience by optimized traffic guidance. Transp. A Transp. Sci. 13, 1–33 (2016b)
Zurück zum Zitat Kim, B.J., Kim, W.: An equilibrium network design model with a social cost function for multimodal networks. Ann. Reg. Sci. 40(3), 473–491 (2006)CrossRef Kim, B.J., Kim, W.: An equilibrium network design model with a social cost function for multimodal networks. Ann. Reg. Sci. 40(3), 473–491 (2006)CrossRef
Zurück zum Zitat LeBlanc, L.J.: An algorithm for the discrete network design problem. Transp. Sci. 9(3), 183–199 (1975)CrossRef LeBlanc, L.J.: An algorithm for the discrete network design problem. Transp. Sci. 9(3), 183–199 (1975)CrossRef
Zurück zum Zitat Luathep, P., Sumalee, A., Lam, W.H., Li, Z.-C., Lo, H.K.: Global optimization method for mixed transportation network design problem: a mixed-integer linear programming approach. Transp. Res. Part B Methodol. 45(5), 808–827 (2011)CrossRef Luathep, P., Sumalee, A., Lam, W.H., Li, Z.-C., Lo, H.K.: Global optimization method for mixed transportation network design problem: a mixed-integer linear programming approach. Transp. Res. Part B Methodol. 45(5), 808–827 (2011)CrossRef
Zurück zum Zitat Marcotte, P., Wynter, L.: A new look at the multiclass network equilibrium problem. Transp. Sci. 38(3), 282–292 (2004)CrossRef Marcotte, P., Wynter, L.: A new look at the multiclass network equilibrium problem. Transp. Sci. 38(3), 282–292 (2004)CrossRef
Zurück zum Zitat Miandoabchi, E., Farahani, R.Z., Dullaert, W., Szeto, W.: Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks. Netw. Spat. Econ. 12(3), 441–480 (2012)CrossRef Miandoabchi, E., Farahani, R.Z., Dullaert, W., Szeto, W.: Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks. Netw. Spat. Econ. 12(3), 441–480 (2012)CrossRef
Zurück zum Zitat Murray-Tuite, P.M.: Transportation network risk profile for an origin-destination pair: security measures, terrorism, and target and attack method substitution. Transp. Res. Rec. J. Transp. Res. Board 2041(1), 19–28 (2008). https://doi.org/10.3141/2041-03 CrossRef Murray-Tuite, P.M.: Transportation network risk profile for an origin-destination pair: security measures, terrorism, and target and attack method substitution. Transp. Res. Rec. J. Transp. Res. Board 2041(1), 19–28 (2008). https://​doi.​org/​10.​3141/​2041-03 CrossRef
Zurück zum Zitat Ng, M., Lin, D.Y., Waller, S.T.: Optimal long-term infrastructure maintenance planning accounting for traffic dynamics. Comput. Aided Civ. Infrastruct. Eng. 24(7), 459–469 (2009)CrossRef Ng, M., Lin, D.Y., Waller, S.T.: Optimal long-term infrastructure maintenance planning accounting for traffic dynamics. Comput. Aided Civ. Infrastruct. Eng. 24(7), 459–469 (2009)CrossRef
Zurück zum Zitat Pas, E.I., Principio, S.L.: Braess’ paradox: some new insights. Transp. Res. Part B Methodol. 31(3), 265–276 (1997)CrossRef Pas, E.I., Principio, S.L.: Braess’ paradox: some new insights. Transp. Res. Part B Methodol. 31(3), 265–276 (1997)CrossRef
Zurück zum Zitat Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Courier Dover Publications, Mineola (2015) Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Courier Dover Publications, Mineola (2015)
Zurück zum Zitat Poorzahedy, H., Rouhani, O.M.: Hybrid meta-heuristic algorithms for solving network design problem. Eur. J. Oper. Res. 182(2), 578–596 (2007)CrossRef Poorzahedy, H., Rouhani, O.M.: Hybrid meta-heuristic algorithms for solving network design problem. Eur. J. Oper. Res. 182(2), 578–596 (2007)CrossRef
Zurück zum Zitat Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transp. Res. Part B Methodol. 13(4), 295–304 (1979)CrossRef Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transp. Res. Part B Methodol. 13(4), 295–304 (1979)CrossRef
Zurück zum Zitat Solanki, R.S., Gorti, J.K., Southworth, F.: Using decomposition in large-scale highway network design with a quasi-optimization heuristic. Transp. Res. Part B Methodol. 32(2), 127–140 (1998)CrossRef Solanki, R.S., Gorti, J.K., Southworth, F.: Using decomposition in large-scale highway network design with a quasi-optimization heuristic. Transp. Res. Part B Methodol. 32(2), 127–140 (1998)CrossRef
Zurück zum Zitat Tzeng, G.-H., Huang, J.-J.: Fuzzy Multiple Objective Decision Making. CRC Press, Boca Raton (2013) Tzeng, G.-H., Huang, J.-J.: Fuzzy Multiple Objective Decision Making. CRC Press, Boca Raton (2013)
Zurück zum Zitat Wang, C.: Urban transportation networks: analytical modeling of spatial dependencies and calibration techniques for stochastic traffic simulators. Ph.D. thesis, Massachusetts Institute of Technology (2013) Wang, C.: Urban transportation networks: analytical modeling of spatial dependencies and calibration techniques for stochastic traffic simulators. Ph.D. thesis, Massachusetts Institute of Technology (2013)
Zurück zum Zitat Xiong, Y., Schneider, J.B.: Transportation network design using a cumulative genetic algorithm and neural network. Transp. Res. Rec. 1364, 37–44 (1993) Xiong, Y., Schneider, J.B.: Transportation network design using a cumulative genetic algorithm and neural network. Transp. Res. Rec. 1364, 37–44 (1993)
Zurück zum Zitat Xu, T., Wei, H., Hu, G.: Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Syst. Appl. 36(2), 1322–1328 (2009)CrossRef Xu, T., Wei, H., Hu, G.: Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Syst. Appl. 36(2), 1322–1328 (2009)CrossRef
Metadaten
Titel
A model for multi-class road network recovery scheduling of regional road networks
verfasst von
Arash Kaviani
Russell G. Thompson
Abbas Rajabifard
Majid Sarvi
Publikationsdatum
13.01.2018
Verlag
Springer US
Erschienen in
Transportation / Ausgabe 1/2020
Print ISSN: 0049-4488
Elektronische ISSN: 1572-9435
DOI
https://doi.org/10.1007/s11116-017-9852-5

Weitere Artikel der Ausgabe 1/2020

Transportation 1/2020 Zur Ausgabe

    Premium Partner