Skip to Main content Skip to Navigation
Journal articles

Team Orienteering Problem with Decreasing Profits

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).
Document type :
Journal articles
Complete list of metadata
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Thursday, February 20, 2020 - 11:19:46 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM





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



Les métriques sont temporairement indisponibles