Publication Date:
2020-08-05
Description:
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 combinato-
rial optimization problems: the traveling salesman and the
linear ordering problem. In this paper we present several
possible IP-Models for this problem and compared them to
their usability for branch-and-cut approaches.
Language:
English
Type:
conferenceobject
,
doc-type:conferenceObject