An augmented large neighborhood search method for solving the team orienteering problem

详细信息    查看全文

• 作者：Byung-In Kim^a ; ^{bkim@postech.ac.kr} ; Hong Li^a ; Andrew L. Johnson^b
• 关键词：Team orienteering problem ; Large neighborhood search ; Heuristics ; Vehicle routing problem
• 刊名：Expert Systems with Applications
• 出版年：2013
• 出版时间：15 June, 2013
• 年：2013
• 卷：40
• 期：8
• 页码：3065-3072
• 全文大小：408 K

文摘

In the Team Orienteering Problem (TOP), a team of vehicles attempts to collect rewards at a given number of stops within a specified time frame. Once a vehicle visits a stop and collects its reward, no other vehicles can collect the reward again. Typically, a team cannot visit all stops and therefore has to identify the ¡°best¡± set of stops to visit in order to maximize total rewards. We propose a large neighborhood search method with three improvement algorithms: a local search improvement, a shift and insertion improvement, and replacement improvement. Our proposed approach can find the best known solutions for 386 of the 387 benchmark instances, for the one instance which our solution is not the current best it is only varies by one from the best. Our approach outperforms all the previous approaches in terms of solution quality and computation time.