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 条
  • [31] Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
    Basu, Sumanta
    Sharma, Megha
    Ghosh, Partha Sarathi
    INFOR, 2017, 55 (02) : 134 - 158
  • [32] Tabu search heuristic using genetic diversification for the clustered traveling salesman problem
    Laporte, Gilbert
    Potvin, Jean-Yves
    Quilleret, Florence
    Journal of Heuristics, 2 (03): : 187 - 200
  • [33] Tabu search heuristic using genetic diversification for the clustered traveling salesman problem
    Laporte Gilbert
    Potvin Jean-Yves
    Quilleret Florence
    Journal of Heuristics, 1997, 2 (3) : 187 - 200
  • [34] An integer programming-based local search for the covering salesman problem
    Salari, Majid
    Naji-Azimi, Zahra
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2594 - 2602
  • [35] Dynamic Tabu Search Algorithm for Solving Departure Scheduling Problem
    王来军
    史忠科
    雷秀娟
    Journal of Southwest Jiaotong University(English Edition), 2007, (02) : 132 - 137
  • [36] Solving the uncapacitated facility location problem using tabu search
    Sun, MH
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (09) : 2563 - 2589
  • [37] Online covering salesman problem
    Zhang, Huili
    Xu, Yinfeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (03) : 941 - 954
  • [38] The Generalized Covering Salesman Problem
    Golden, Bruce
    Naji-Azimi, Zahra
    Raghavan, S.
    Salari, Majid
    Toth, Paolo
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) : 534 - 553
  • [39] Efficiently solving the redundancy allocation problem using tabu search
    Kulturel-Konak, S
    Smith, AE
    Coit, DW
    IIE TRANSACTIONS, 2003, 35 (06) : 515 - 526
  • [40] Solving the frequency assignment problem with polarization by local search and tabu
    Galinier P.
    Gendreau M.
    Soriano P.
    Bisaillon S.
    4OR, 2005, 3 (1) : 59 - 78
12345