New approaches for the prize-collecting covering tour problem

被引：0

作者：

Clímaco G. ^{[1
]}

Simonetti L. ^{[2
]}

Rosseti I. ^{[3
]}

González P.H. ^{[4
]}

机构：

[1] Departamento de Informática, Universidade Federal do Maranhão, São Luís

[2] Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, Rio de Janeiro

[3] Instituto de Computação, Universidade Federal Fluminense, Niterói

[4] Departamente de Ciência da Computação, Centro Federal de Educação Tecnológica Celso Suckow da Foseca, Rio de Janeiro

来源：

International Journal of Industrial and Systems Engineering | 2023年 / 45卷 / 01期

关键词：

GRASP; greedy randomised adaptive search procedure; hybrid heuristic; PCCTP; prize-collecting covering tour problem; random variable neighbourhood descent; reduction rules; RVND;

D O I：

10.1504/IJISE.2023.133526

中图分类号：

学科分类号：

摘要：

In this paper, we consider the prize-collecting covering tour problem (PCCTP), which intends to find a minimum cost tour for travelling teams that grant assistance to people located far from urban centres. We develop a branch-and-cut algorithm, some valid inequalities, and a new set of reduction rules as exact approaches. We also present a hybrid heuristic that combines a state-of-the-art heuristic for the PCCTP with integer programming techniques. Computational experiments showed that the exact approaches found several new optimal solutions while reducing CPU time, and the hybrid heuristic was able to match or improve the solution quality for many instances, along with a significant reduction of running time. Copyright © 2023 Inderscience Enterprises Ltd.

引用

页码：101 / 134

页数：33

共 50 条

[1] Reactive GRASP for the Prize-collecting Covering Tour Problem
Climaco, Glaubos
Rosseti, Isabel
Da Silva, Rogerio
Guerine, Marcos
RAIRO-OPERATIONS RESEARCH, 2021, 55 (03) : 1441 - 1457
[2] Solving the Prize-collecting Rural Postman Problem
Araoz, Julian
Fernandez, Elena
Meza, Oscar
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) : 886 - 896
[3] Variations of the prize-collecting Steiner tree problem
Chapovska, Olena
Punnen, Abraham P.
NETWORKS, 2006, 47 (04) : 199 - 205
[4] Reduction tests for the prize-collecting Steiner problem
Uchoa, E
OPERATIONS RESEARCH LETTERS, 2006, 34 (04) : 437 - 444
[5] Exact algorithms for budgeted prize-collecting covering subgraph problems
Morandi, N.
Leus, R.
Yaman, H.
COMPUTERS & OPERATIONS RESEARCH, 2022, 144
[6] The Clustered Prize-Collecting Arc Routing Problem
Araoz, Julian
Fernandez, Elena
Franquesa, Carles
TRANSPORTATION SCIENCE, 2009, 43 (03) : 287 - 300
[7] The online Prize-Collecting Traveling Salesman Problem
Ausiello, Giorgio
Bonifaci, Vincenzo
Laura, Luigi
INFORMATION PROCESSING LETTERS, 2008, 107 (06) : 199 - 204
[8] A Matheuristic Algorithm for the Prize-collecting Steiner Tree Problem
Akhmedov, Murodzhon
Kwee, Ivo
Montemanni, Roberto
2015 3rd International Conference on Information and Communication Technology (ICoICT), 2015, : 408 - 412
[9] On the prize-collecting generalized minimum spanning tree problem
Pop, P. C.
ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) : 193 - 204
[10] Algorithms for the Prize-Collecting $k$-Steiner Tree Problem
Han, Lu
Wang, Changjun
Xu, Dachuan
Zhang, Dongmei
TSINGHUA SCIENCE AND TECHNOLOGY, 2022, 27 (05) : 785 - 792

← 1 2 3 4 5 →