Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

被引：0
|
作者：
Coste, Pierre [1 ]
Lodi, Andrea [1 ]
Pesant, Gilles [1 ]
机构：
[1] Polytech Montreal, Montreal, PQ, Canada
来源：
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2019 | 2019年 / 11494卷
关键词：
SPANNING TREE CONSTRAINT; COUNTING-BASED SEARCH; BOUNDS;
D O I：
10.1007/978-3-030-19212-9_12
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Traveling Salesman Problem, at the heart of many routing applications, has a few well-known relaxations that have been very effective to compute lower bounds on the objective function or even to perform cost-based domain filtering in constraint programming models. We investigate other ways of using such relaxations based on computing the frequency of edges in near-optimal solutions to a relaxation. We report early empirical results on symmetric instances from TSPLIB.
引用
收藏
页码：182 / 191
页数：10
相关论文
共 50 条
  • [1] Cost-based QoS routing
    Chu, J
    Lea, CT
    Wong, A
    ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2003, : 485 - 490
  • [2] A cost-based analysis of overlay routing geometries
    Christin, N
    Chuang, J
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 2566 - 2577
  • [3] Quantization, state reduction and cost-based admission and routing
    Lea, CT
    Ke, KW
    COMPUTER COMMUNICATIONS, 1996, 19 (13) : 1051 - 1064
  • [4] Cost-based classifier evaluation for imbalanced problems
    Landgrebe, T
    Paclík, P
    Tax, DMJ
    Verzakov, S
    Duin, RPW
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, 2004, 3138 : 762 - 770
  • [5] The first AI4TSP competition: Learning to solve stochastic routing problems
    Zhang, Yingqian
    Bliek, Laurens
    da Costa, Paulo
    Afshar, Reza Refaei
    Reijnen, Robbert
    Catshoek, Tom
    Vos, Daniel
    Verwer, Sicco
    Schmitt-Ulms, Fynn
    Hottung, Andre
    Shah, Tapan
    Sellmann, Meinolf
    Tierney, Kevin
    Perreault-Lafleur, Carl
    Leboeuf, Caroline
    Bobbio, Federico
    Pepin, Justine
    Silva, Warley Almeida
    Gama, Ricardo
    Fernandes, Hugo L.
    Zaefferer, Martin
    Lopez-Ibanez, Manuel
    Irurozki, Ekhine
    ARTIFICIAL INTELLIGENCE, 2023, 319
  • [6] Cost-based Hierarchical Energy Efficient Routing Scheme for WSNs
    Murtaza, Zain
    Khan, Mohsin Ali
    Ahmed, Husnain
    Sheikh, Usman Ayub
    Shabbir, Ghulam
    2016 2ND INTERNATIONAL CONFERENCE ON ROBOTICS AND ARTIFICIAL INTELLIGENCE (ICRAI), 2016, : 218 - 224
  • [7] On cost-based routing in connection-oriented broadband networks
    Ke, KW
    Lea, CT
    GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1522 - 1526
  • [8] Simulation study of dynamic cost-based routing in PNNI networks
    Conte, M
    Rammer, J
    Fischer, G
    Mersch, N
    Chummun, F
    Bella, L
    ATM 2000: PROCEEDINGS OF THE IEEE CONFERENCE 2000 ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2000, : 117 - 123
  • [9] Distributed cost-based update policies for QoS routing on hierarchical networks
    Chang, BJ
    Hwang, RH
    INFORMATION SCIENCES, 2004, 159 (1-2) : 87 - 108
  • [10] Performance of Multisource Application Layer Multicast Routing: A Cost-Based Approach
    Huang, Chia-Hui
    Ke, Kai-Wei
    Wu, Ho-Ting
    MATERIAL AND MANUFACTURING TECHNOLOGY II, PTS 1 AND 2, 2012, 341-342 : 617 - 622
12345