Team Orienteering Problem with Decreasing Profits - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2013

Team Orienteering Problem with Decreasing Profits

(1) , (1)
1

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).
Not file

Dates and versions

hal-02485540 , version 1 (20-02-2020)

Identifiers

Cite

Hasan Murat Afsar, Nacima Labadie. Team Orienteering Problem with Decreasing Profits. Electronic Notes in Discrete Mathematics, 2013, 41, pp.285-293. ⟨10.1016/j.endm.2013.05.104⟩. ⟨hal-02485540⟩

Collections

CNRS UTT LOSI
12 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More