Inter 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....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2015
|
| In: |
Informatica
Year: 2015, Volume: 39, Issue: 3, Pages: 257-260 |
| ISSN: | 0350-5596 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: http://www.informatica.si/index.php/informatica/article/view/981
|
| Author Notes: | Achim Hildenbrandt, Gerhard Reinelt |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 14.09.2020 |
| Physical Description: | Online Resource |
| ISSN: | 0350-5596 |