A branch‐and‐cut algorithm for the Team Orienteering Problem
Copyright policy )A branch‐and‐cut algorithm for the Team Orienteering Problem
AbstractThe 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.
- Johannes Gutenberg University of Mainz Germany
- University of Brescia Italy
- University of Milan Italy
branch-and-cut algorithm; Team Orienteering Problem; two-index mathematical formulation; Computer Science Applications1707 Management Science and Operations Research;, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Team Orienteering Problem; two-index mathematical formulation; branch-and-cut algorithm, branch-and-cut algorithm, Programming involving graphs or networks, team orienteering problem, two-index mathematical formulation
branch-and-cut algorithm; Team Orienteering Problem; two-index mathematical formulation; Computer Science Applications1707 Management Science and Operations Research;, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Team Orienteering Problem; two-index mathematical formulation; branch-and-cut algorithm, branch-and-cut algorithm, Programming involving graphs or networks, team orienteering problem, two-index mathematical formulation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).66 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 1% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!