A branch-and-cut algorithm for the Team Orienteering Problem

被引：49

作者：

Bianchessi, Nicola ^{[1
]}

Mansini, Renata ^{[2
]}

Speranza, M. Grazia ^{[3
]}

机构：

[1] Johannes Gutenberg Univ Mainz, Gutenberg Sch Management & Econ, Chair Logist Management, Jakob Welder Weg 9, D-55128 Mainz, Germany

[2] Univ Brescia, Dept Informat Engn, Via Branze 38, I-25123 Brescia, Italy

[3] Univ Brescia, Dept Econ & Management, Cda S Chiara 50, I-25122 Brescia, Italy

来源：

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2018年 / 25卷 / 02期

关键词：

Team Orienteering Problem; two-index mathematical formulation; branch-and-cut algorithm;

D O I：

10.1111/itor.12422

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we present a new two-index formulation with a polynomial number of variables and constraints. This compact formulation, reinforced by connectivity constraints, was solved by means of a branch-and-cut algorithm. The total number of instances solved to optimality is 327 of 387 benchmark instances, 26 more than any previous method. Moreover, 24 not previously solved instances were closed to optimality.

引用

页码：627 / 635

页数：9

共 50 条

[1] A branch-and-cut algorithm for the Orienteering Arc Routing Problem
Archetti, Claudia
Corberan, Angel
Plana, Isaac
Sanchis, Jose M.
Grazia Speranza, M.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 66 : 95 - 104
[2] A new formulation and a branch-and-cut algorithm for the set orienteering problem
Archetti, C.
Carrabs, F.
Cerulli, R.
Laureana, F.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 314 (02) : 446 - 465
[3] Branch-and-cut algorithm for the equicut problem
Universita degli Studi di Padova, Padova, Italy
[J]. Math Program Ser B, 2 (243-263):
[4] A branch-and-cut algorithm for the equicut problem
Brunetta, L
Conforti, M
Rinaldi, G
[J]. MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 243 - 263
[5] A branch-and-cut algorithm for the equicut problem
Lorenzo Brunetta
Michele Conforti
Giovanni Rinaldi
[J]. Mathematical Programming, 1997, 78 : 243 - 263
[6] A revisited branch-and-cut algorithm for large-scale orienteering problems
Kobeaga, Gorka
Rojas-Delgado, Jairo
Merino, Maria
Lozano, Jose A.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 313 (01) : 44 - 68
[7] A branch-and-cut algorithm for an assembly routing problem
Chitsaz, Masoud
Cordeau, Jean-Francois
Jans, Raf
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 896 - 910
[8] A branch-and-cut algorithm for the preemptive swapping problem
Bordenave, Charles
Gendreau, Michel
Laporte, Gilbert
[J]. NETWORKS, 2012, 59 (04) : 387 - 399
[9] A Branch-and-Cut Algorithm for the Nonpreemptive Swapping Problem
Bordenave, Charles
Gendreau, Michel
Laporte, Gilbert
[J]. NAVAL RESEARCH LOGISTICS, 2009, 56 (05) : 478 - 486
[10] A branch-and-cut algorithm for the pallet loading problem
Alvarez-Valdes, R
Parreño, F
Tamarit, JM
[J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (11) : 3007 - 3029

← 1 2 3 4 5 →