Inter programming models for the target visitation problem

• Verfasst von: Hildenbrandt, Achim [VerfasserIn]
• Verfasst von: Reinelt, Gerhard [VerfasserIn]
• Titel: Inter programming models for the target visitation problem
• Verf.angabe: Achim Hildenbrandt, Gerhard Reinelt
• Jahr: 2015
• Umfang: 4 S.
• Fussnoten: Gesehen am 14.09.2020
• Titel Quelle: Enthalten in: Informatica
• Ort Quelle: Ljubljana : Slovene Soc. Informatika, 1977
• Jahr Quelle: 2015
• Band/Heft Quelle: 39(2015), 3, Seite 257-260
• ISSN Quelle: 0350-5596
• Datenträger: Online-Ressource
• Sprache: eng
• K10plus-PPN: 1731797621

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.