Matches in UGent Biblio for { ?s ?p In the regular Team Orienteering Problem, a set of locations is given, each with a score. The goal is to determine a fixed number of trips, each within a given time budget, in order to maximize the total collected score. All trips start (and end) at the same starting point. The Orienteering Problem with Hotel Selection (OPHS) also has a fixed number of trips, but each trip can end in any of the available hotels and the next trip should start in the same hotel. In the ongoing research, we formulate the OPHS mathematically, develop a heuristic to solve it and design appropriate benchmark instances.. }
Showing items 1 to 1 of
1
with 100 items per page.
- aggregation abstract "In the regular Team Orienteering Problem, a set of locations is given, each with a score. The goal is to determine a fixed number of trips, each within a given time budget, in order to maximize the total collected score. All trips start (and end) at the same starting point. The Orienteering Problem with Hotel Selection (OPHS) also has a fixed number of trips, but each trip can end in any of the available hotels and the next trip should start in the same hotel. In the ongoing research, we formulate the OPHS mathematically, develop a heuristic to solve it and design appropriate benchmark instances.".