An enhanced Benders decomposition method for unique shortest path routing

Author:

Zhang ChangyongORCID

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

Subject

Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems

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)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3