Top-percentile traffic routing problem by dynamic programming

被引:0
|
作者
Andreas Grothey
Xinan Yang
机构
[1] The University of Edinburgh,School of Mathematics, College of Science and Engineering
来源
Optimization and Engineering | 2011年 / 12卷
关键词
Top-percentile; Multi-homing; Mixed-integer stochastic programming problem; Dynamic programming;
D O I
暂无
中图分类号
学科分类号
摘要
Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via different network providers. To make full use of the underlying networks with minimum cost, an optimal routing strategy is required by ISPs. This study investigates the optimal routing strategy in case where network providers charge ISPs according to top-percentile pricing. We call this problem the Top-percentile Traffic Routing Problem (TpTRP). The TpTRP is a multistage stochastic optimisation problem in which routing decision should be made before knowing the amount of traffic that is to be routed in the following time period. The stochastic nature of the problem forms the critical difficulty of this study.
引用
收藏
页码:631 / 655
页数:24
相关论文
共 50 条
  • [1] Top-percentile traffic routing problem by dynamic programming
    Grothey, Andreas
    Yang, Xinan
    OPTIMIZATION AND ENGINEERING, 2011, 12 (04) : 631 - 655
  • [2] Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming
    Yang, Xinan
    Grothey, Andreas
    IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2012, 23 (04) : 413 - 434
  • [3] Approximate dynamic programming with Bezier Curves/Surfaces for Top-percentile Traffic Routing
    Grothey, Andreas
    Yang, Xinan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (03) : 698 - 707
  • [4] Dynamic programming approximations for a stochastic inventory routing problem
    Kleywegt, AJ
    Nori, VS
    Savelsbergh, MWP
    TRANSPORTATION SCIENCE, 2004, 38 (01) : 42 - 70
  • [5] Approximate dynamic programming for the military inventory routing problem
    Rebekah S. McKenna
    Matthew J. Robbins
    Brian J. Lunday
    Ian M. McCormack
    Annals of Operations Research, 2020, 288 : 391 - 416
  • [6] Approximate dynamic programming for the military inventory routing problem
    McKenna, Rebekah S.
    Robbins, Matthew J.
    Lunday, Brian J.
    McCormack, Ian M.
    ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 391 - 416
  • [7] Two-Stage Dynamic Programming in the Routing Problem with Decomposition
    A. G. Chentsov
    P. A. Chentsov
    Automation and Remote Control, 2023, 84 : 543 - 563
  • [8] Deliveries in an inventory/routing problem using stochastic dynamic programming
    Berman, O
    Larson, RC
    TRANSPORTATION SCIENCE, 2001, 35 (02) : 192 - 213
  • [9] Two-Stage Dynamic Programming in the Routing Problem with Decomposition
    Chentsov, A. G.
    Chentsov, P. A.
    AUTOMATION AND REMOTE CONTROL, 2023, 84 (05) : 543 - 563
  • [10] Solving the routing optimization problem using the dynamic programming method
    Chentsov, AA
    Chentsov, AG
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1999, 38 (03) : 409 - 420