| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651790 | Electronic Notes in Discrete Mathematics | 2013 | 9 Pages |
Abstract
Team Orienteering with Decreasing Profits (DP-TOP) extends the classical Team Orienteering problem (TOP) by considering the profit of each client as a decreasing function of time. It consists of maximizing the sum of collected profit by a fixed number K of vehicles, visiting each client at most once. In this work, we present lower bounds based on a Dantzig-Wolfe decomposition and column generation as well as upper bounds obtained by an evolutionary local search approach (ELS).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
