Inter Programming Models for the Target Visitation Problem
Abstract
The target visitation problem (TVP) is concerned with finding a route to visit a set of targets starting
from and returning to some base. In addition to the distance traveled a tour is evaluated by taking also
preferences into account which address the sequence in which the targets are visited. The problem thus
is a combination of two well-known combinatorial optimization problems: the traveling salesman and the
linear ordering problem. In this paper we point out some polyhedral properties and develop a branch-andcut
algorithm for solving the TVP to optimality. Some computational results are presented.
from and returning to some base. In addition to the distance traveled a tour is evaluated by taking also
preferences into account which address the sequence in which the targets are visited. The problem thus
is a combination of two well-known combinatorial optimization problems: the traveling salesman and the
linear ordering problem. In this paper we point out some polyhedral properties and develop a branch-andcut
algorithm for solving the TVP to optimality. Some computational results are presented.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution 3.0 License.