A Greedy Constructive Heuristic for Solving the Team Orienteering Problem with Variable Time Windows
Abstract Orienteering problems are a subclass of routing problems, in which a selection of the set of nodes should be made for visiting, due to route length restrictions. These nodes can also impose time-window constraints, which can be variable if they are defined by a spread process, which behavio...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-03-01
|
| Series: | International Journal of Computational Intelligence Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s44196-025-00797-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|