Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

4-2015

Abstract

The Orienteering Problem with Time Windows (OPTW) is a variant of the Orienteering Problem (OP). Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, which is based on several LocalSearch operations, such as swap, 2-opt, insert and replace. We also implement the combination between AcceptanceCriterion and Perturbation mechanisms to control the balance between diversification and intensification of the search. In Perturbation, Shake strategy is introduced. The computational results obtained by our proposed algorithm are compared against optimal solutions or best known solution values obtained by state-of-the-art algorithms. We show experimentally that our proposed algorithm is effective on well-known benchmark instances available in the literature. It is also able to improve the best known solution of some benchmark instances.

Keywords

Orienteering problem, Time windows, Iterated local search

Discipline

Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms

Publication

Evolutionary Computation in Combinatorial Optimization: 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

First Page

61

Last Page

73

ISBN

9783319164670

Identifier

10.1007/978-3-319-16468-7_6

Publisher

Springer

City or Country

Cham

Copyright Owner and License

LARC

Additional URL

http://doi.org/10.1007/978-3-319-16468-7_6

Download

Share

COinS