Team Orienteering Problem with Decreasing Profits

详细信息    查看全文

• 作者：H. Murat Afsar^a ; ^{murat.afsar@utt.fr} ; Nacima Labadie^a ; ^{nacima.labadie@utt.fr}
• 关键词：Team Orienteering problem ; variable profits ; column generation ; ELS
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2013
• 出版时间：5 June, 2013
• 年：2013
• 卷：41
• 期：Complete
• 页码：285-293
• 全文大小：197 K

文摘

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