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.
Vol. 39, No.3

Authors

  • Achim Hildenbrandt
  • Gerhard Reinelt

Downloads

How to Cite

Hildenbrandt, A. . ., & Reinelt, G. . . (2015). Inter Programming Models for the Target Visitation Problem. Informatica, 39(3). Retrieved from https://www.informatica.si/index.php/informatica/article/view/981

Issue

Vol. 39 No. 3 (2015)

Section

Special issue papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.