6533b7dcfe1ef96bd12734e3

RESEARCH PRODUCT

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

M. Grazia SperanzaRenata MansiniNicola Bianchessi

subject

branch-and-cut algorithm; Team Orienteering Problem; two-index mathematical formulation; Computer Science Applications1707 Management Science and Operations Research;0209 industrial biotechnologyMathematical optimization021103 operations researchStrategy and Management0211 other engineering and technologiesOrienteering02 engineering and technologyManagement Science and Operations ResearchComputer Science Applicationstwo-index mathematical formulationTravel timeComputer Science Applications1707 Management Science and Operations Research020901 industrial engineering & automationManagement of Technology and InnovationBenchmark (computing)Limit (mathematics)branch-and-cut algorithmTeam Orienteering ProblemBusiness and International ManagementBranch and cutAlgorithmPolynomial numberMathematics

description

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.

yearjournalcountryeditionlanguage
2017-05-17
10.1111/itor.12422http://hdl.handle.net/11379/501069