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

共 8 条

[1]

[Anonymous], 2010, 8 DIMACS IMPLEMENTAT

[2]

[Anonymous], Gurobi Optimization

[3] THE COVERING SALESMAN PROBLEM [J].

CURRENT, JR ;

SCHILLING, DA .

TRANSPORTATION SCIENCE, 1989, 23 (03) :208-213

[4]

Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]

[5]

Glover F., 1993, Annals of Operations Research, V41, P3

[6]

Holland J.H., 1975, Adaptation in natural and artificial systems, V1, P5

[7] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[8]

Matsuura T., 2017, American Journal of Operations Research, V7, P249

← 1 →