A Compact Model for the Clustered Orienteering Problem
<i>Background:</i> The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time. The vertices to visit have to be selected among a set...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-05-01
|
| Series: | Logistics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2305-6290/8/2/48 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|