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 条
  • [31] A Branch-and-Cut algorithm for factory crane scheduling problem
    Cheng, Xu
    Tang, Lixin
    Pardalos, Panos M.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 63 (04) : 729 - 755
  • [32] A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
    Avella, Pasquale
    Boccia, Maurizio
    Vasilyev, Igor
    [J]. IEEE ACCESS, 2013, 1 : 475 - 479
  • [33] A Branch-and-Cut Algorithm for the Median-Path Problem
    Pasquale Avella
    Maurizio Boccia
    Antonio Sforza
    Igor Vasil'Ev
    [J]. Computational Optimization and Applications, 2005, 32 : 215 - 230
  • [34] A branch-and-cut algorithm for the Undirected Rural Postman Problem
    Gianpaolo Ghiani
    Gilbert Laporte
    [J]. Mathematical Programming, 2000, 87 : 467 - 481
  • [35] A branch-and-cut algorithm for the hub location and routing problem
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan-Jose
    Yaman, Hande
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 50 : 161 - 174
  • [36] A branch-and-cut algorithm for the Steiner tree problem with delays
    V. Leggieri
    M. Haouari
    C. Triki
    [J]. Optimization Letters, 2012, 6 : 1753 - 1771
  • [37] A Branch-and-Cut algorithm for factory crane scheduling problem
    Xu Cheng
    Lixin Tang
    Panos M. Pardalos
    [J]. Journal of Global Optimization, 2015, 63 : 729 - 755
  • [38] A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
    Silvestri, Selene
    Laporte, Gilbert
    Cerulli, Raffaele
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 322 - 332
  • [39] A branch-and-cut algorithm for a realistic dial-a-ride problem
    Liu, Mengyang
    Luo, Zhixing
    Lim, Andrew
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 : 267 - 288
  • [40] A branch-and-cut algorithm for the profitable windy rural postman problem
    Avila, Thais
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (03) : 1092 - 1101
12345