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 条
  • [21] Comparison of a memetic algorithm and a tabu search algorithm for the Traveling Salesman Problem
    Osaba, Eneko
    Diaz, Fernando
    2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2012, : 131 - 136
  • [22] Edge Assembly Crossover Incorporating Tabu Search for the Traveling Salesman Problem
    Sakai, Maaki
    Hokazono, Kanon
    Hanada, Yoshiko
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (10) : 1627 - 1631
  • [23] Comparison of genetic search and tabu search for the time-constrained travelling salesman problem
    Yang, C.H.
    Journal of Electrical and Electronics Engineering, Australia, 1998, 18 (01): : 55 - 59
  • [24] Backbone guided tabu search for solving the UBQP problem
    Wang, Yang
    Lu, Zhipeng
    Glover, Fred
    Hao, Jin-Kao
    JOURNAL OF HEURISTICS, 2013, 19 (04) : 679 - 695
  • [25] Solving the Economic Dispatch Problem with Tabu Search Algorithm
    Khamsawang, S
    Boonseng, C
    Pothiya, S
    IEEE ICIT' 02: 2002 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY, VOLS I AND II, PROCEEDINGS, 2002, : 274 - 278
  • [26] Backbone guided tabu search for solving the UBQP problem
    Yang Wang
    Zhipeng Lü
    Fred Glover
    Jin-Kao Hao
    Journal of Heuristics, 2013, 19 : 679 - 695
  • [27] Solving the flow shop problem by parallel tabu search
    Bozejko, W
    Wodecki, M
    PAR ELEC 2002: INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, 2002, : 189 - 194
  • [28] Solving the job shop scheduling problem with tabu search
    Univ of Texas at Austin, Austin, United States
    IIE Trans, 2 (257-263):
  • [29] Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem
    Basu, Sumanta
    OPSEARCH, 2012, 49 (04) : 400 - 412
  • [30] Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem
    Sumanta Basu
    OPSEARCH, 2012, 49 (4) : 400 - 412
12345