Open Access System for Information Sharing

Login Library

 

Article
Cited 33 time in webofscience Cited 38 time in scopus
Metadata Downloads

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

Title
An augmented large neighborhood search method for solving the team orienteering problem
Authors
Kim, BILi, HJohnson, AL
Date Issued
2013-06-15
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Abstract
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords
Team orienteering problem; Large neighborhood search; Heuristics; Vehicle routing problem; MAXIMUM COLLECTION PROBLEM; ALGORITHM
URI
https://oasis.postech.ac.kr/handle/2014.oak/15266
DOI
10.1016/J.ESWA.2012.12.022
ISSN
0957-4174
Article Type
Article
Citation
EXPERT SYSTEMS WITH APPLICATIONS, vol. 40, no. 8, page. 3065 - 3072, 2013-06-15
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

김병인KIM, BYUNG IN
Dept. of Industrial & Management Eng.
Read more

Views & Downloads

Browse