Tabu Search for Solving Covering Salesman Problem with Nodes and Segments

被引：0
|
作者：
Matsuura, Takafumi [1 ]
机构：
[1] Nippon Inst Technol, 4-1 Gakuendai, Miyashiro, Saitama 3458501, Japan
来源：
METAHEURISTICS, MIC 2024, PT I | 2024年 / 14753卷
关键词：
Covering Problem; Tabu Search; Heuristic Method;
D O I：
10.1007/978-3-031-62912-9_9
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We have already mathematically formulated a Covering Salesman Problem with Nodes and Segments (CSPNS). In CSPNS, a node distribution is given. In CSPNS, some nodes are selected from the given set, and a tour is constructed that visits these nodes. An objective of CSPNS is to identify the shortest tour that covers all given nodes by segments and nodes in the tour. In this study, to find good near-optimal solutions within a reasonable time frame, we propose a heuristic method using tabu search.
引用
收藏
页码：93 / 99
页数：7
相关论文
共 50 条
  • [1] A parallel variable neighborhood search for solving covering salesman problem
    Xiaoning Zang
    Li Jiang
    Mustapha Ratli
    Bin Ding
    Optimization Letters, 2022, 16 : 175 - 190
  • [2] A parallel variable neighborhood search for solving covering salesman problem
    Zang, Xiaoning
    Jiang, Li
    Ratli, Mustapha
    Ding, Bin
    OPTIMIZATION LETTERS, 2022, 16 (01) : 175 - 190
  • [3] Tabu search for solving the black-and-white travelling salesman problem
    Li, Haitao
    Alidaee, Bahram
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (08) : 1061 - 1079
  • [4] Solving the traveling-salesman problem with time windows using tabu search
    Carlton, WB
    Barnes, JW
    IIE TRANSACTIONS, 1996, 28 (08) : 617 - 629
  • [5] Solving the traveling-salesman problem with time windows using tabu search
    Carlton, W.B.
    Barnes, J.W.
    IIE Transactions (Institute of Industrial Engineers), 1996, 28 (08): : 617 - 629
  • [6] A tabu search algorithm for the covering design problem
    Kamal Fadlaoui
    Philippe Galinier
    Journal of Heuristics, 2011, 17 : 659 - 674
  • [7] A tabu search algorithm for the covering design problem
    Fadlaoui, Kamal
    Galinier, Philippe
    JOURNAL OF HEURISTICS, 2011, 17 (06) : 659 - 674
  • [8] TABU SEARCH PERFORMANCE ON THE SYMMETRICAL TRAVELING SALESMAN PROBLEM
    KNOX, J
    COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (08) : 867 - 876
  • [9] A Hybrid Algorithm Based on Tabu Search and K-Means for Solving the Traveling Salesman Problem
    Nkwengoua, Leopold Kamchoum
    Soh, Mathurin
    RESEARCH IN COMPUTER SCIENCE, CRI 2023, 2024, 2085 : 117 - 128
  • [10] An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem
    Xu, Dan
    Weise, Thomas
    Wu, Yuezhong
    Laessig, Joerg
    Chiong, Raymond
    BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 523 - 537
12345