AN HEURISTIC METHOD FOR SOLVING TIME-SENSITIVE ROUTING-PROBLEMS

被引:5
|
作者
EVANS, SR
NORBACK, JP
机构
关键词
D O I
10.1057/jors.1984.81
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:407 / 414
页数:8
相关论文
共 50 条
  • [1] A NEW HEURISTIC FOR SINGLE ROW ROUTING-PROBLEMS
    SHERWANI, NA
    DEOGUN, JS
    26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 167 - 172
  • [2] A LOCATION BASED HEURISTIC FOR GENERAL ROUTING-PROBLEMS
    BRAMEL, J
    SIMCHILEVI, D
    OPERATIONS RESEARCH, 1995, 43 (04) : 649 - 660
  • [3] Heuristic Routing Algorithms for Time-Sensitive Networks in Smart Factories
    Li, Yue
    Yin, Zhenyu
    Ma, Yue
    Xu, Fulong
    Yu, Haoyu
    Han, Guangjie
    Bi, Yuanguo
    SENSORS, 2022, 22 (11)
  • [4] VARIABLE REDUCTION METHOD IN ROUTING-PROBLEMS
    PAVLIDOU, F
    KOURIS, SS
    ELECTRONICS LETTERS, 1986, 22 (22) : 1202 - 1203
  • [5] Hybrid method for solving time limited routing problems (routing problems with time limitations)
    Caric, T
    Jelusic, N
    Protega, V
    Jelusic, F
    TRAFFIC IN TRANSITIONAL CONDITIONS: INTELLIGENT TRANSPORT SYSTEMS AND THEIR INTERFACES, PROCEEDINGS, 1999, : 119 - 123
  • [6] Hybrid method for solving time limited routing problems (routing problems with time limitations)
    Caric, T
    Jelusic, N
    Protega, V
    Jelusic, F
    PROMET TRAFFIC-TRAFFICO, VOL 11, SUPPLEMENT 4, 1999, 1999, : 119 - 123
  • [7] Time-sensitive network traffic scheduling method with joint routing planning
    Pei J.
    Hu Y.
    Tian L.
    Hu T.
    Li Z.
    Tongxin Xuebao/Journal on Communications, 2022, 43 (12): : 54 - 65
  • [8] CAPACITATED ARC ROUTING-PROBLEMS
    GOLDEN, BL
    WONG, RT
    NETWORKS, 1981, 11 (03) : 305 - 315
  • [9] BOUNDS AND HEURISTICS FOR CAPACITATED ROUTING-PROBLEMS
    HAIMOVICH, M
    KAN, AHGR
    MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (04) : 527 - 542
  • [10] Coupling Source Routing with Time-Sensitive Networking
    Kumar, Gagan Nandha
    Katsalis, Kostas
    Papadimitriou, Panagiotis
    2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 797 - 802