A branch-and-cut algorithm for the target visitation problem
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance travelled, a tour i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
27 April 2019
|
| In: |
EURO journal on computational optimization
Year: 2019, Volume: 7, Issue: 3, Pages: 209-242 |
| ISSN: | 2192-4414 |
| DOI: | 10.1007/s13675-019-00111-x |
| Online Access: | Resolving-System, Volltext: https://doi.org/10.1007/s13675-019-00111-x Verlag: https://link.springer.com/article/10.1007%2Fs13675-019-00111-x 
|
| Author Notes: | Achim Hildenbrandt |
| Summary: | In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance travelled, 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, develop a branch-and-cut algorithm for solving the TVP to optimality and present some computational results. |
|---|---|
| Item Description: | Gesehen am 28.11.2019 |
| Physical Description: | Online Resource |
| ISSN: | 2192-4414 |
| DOI: | 10.1007/s13675-019-00111-x |