An iterated local search algorithm for the team orienteering problem with variable profits
The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score is maximized and a given time budget is not exceeded. The ex...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Taylor & Francis
2018
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/49526/ |