Integer Programming Models for the Target Visitation Problem
- 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.
Author: | Achim Hildenbrandt, Gerhard Reinelt, Olga Heismann |
---|---|
Document Type: | In Proceedings |
Parent Title (English): | Proceedings of the 16th International Multiconference INFORMATION SOCIETY - IS 2013 |
First Page: | 569 |
Last Page: | 572 |
Fulltext Url: | http://library.ijs.si/Stacks/Proceedings/InformationSociety/IS2013_Volume_A.pdf |
Year of first publication: | 2013 |