An enhanced Benders decomposition method for unique shortest path routing-Reference-Cited by-同舟云学术

An enhanced Benders decomposition method for unique shortest path routing

Published:2024-02-03 Issue:3 Volume:61 Page:989-1012
ISSN:0030-3887
Container-title:OPSEARCH
language:en
Short-container-title:OPSEARCH

Author:

Zhang Changyong^ORCID

Abstract

AbstractWith the aim of looking into a comparatively more efficient solution approach for the unique shortest path routing problem, an alternative problem formulation to a counterpart is first introduced. The model is mathematically equivalent to the counterpart concerning both the feasibility and optimality of the problem. By exploring the constraint structures and model sizes of the two formulations, the former is identified to be a more appropriate one for a decomposition algorithm to solve the problem. An enhanced Benders decomposition method, embedded with redundancy generation strategy, is then proposed, based on the study of problem properties of network flow problems.

Funder

Curtin University

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s12597-023-00718-0.pdf

Reference36 articles.

1. Black, U.: IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols. Prentice Hall PTR (2000)

2. Tanenbaum, A.S., Wetherall, D.J.: Computer Networks. Pearson Prentice Hall (2011)

3. Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Longman Publishing Co., Inc. (1998)

4. Altın, A., Fortz, B., Thorup, M., Ümit, H.: Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1), 65–95 (2013)

5. Bley, A., Fortz, B., Gourdin, E., Holmberg, K., Klopfenstein, O., Pióro, M., et al.: Optimization of OSPF routing in IP networks. In: Muñoz, X., Koster, A. (eds.) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series, pp. 199–240. Springer, Berlin, Heidelberg (2010)