Variable neighborhood search for the orienteering problem

Authors:
Zülal Sevkli;F. Erdoğan Sevilgen
Affiliations:
Department of Computer Engineering, Fatih University, Istanbul, Turkey;Department of Computer Engineering, Gebze Institute of Technology, Gebze, Kocaeli, Turkey
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 5
Cited 3

The selective travelling salesman problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
An efficient four-phase heuristic for the generalized orienteering problem

Computers and Operations Research
Variable neighborhood search for the degree-constrained minimum spanning tree problem

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Traveling Salesman Problems with Profits

Transportation Science

A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times

Computers and Operations Research
Time-dependent personal tour planning and scheduling in metropolises

Expert Systems with Applications: An International Journal
A two-stage approach to the orienteering problem with stochastic weights

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Orienteering Problem (OP) is a version of TSP with profits in which instead of a cycle, a path is sought. In this paper, we consider three variations of Variable Neighborhood Search (VNS) and present the first algorithm solely based on VNS to solve the OP. The experimental results for the benchmark problems indicate that the algorithm, designed by using Reduced VNS instead of the local search phase of the traditional VNS, is the best amongst other variations of VNS we tried; it is the most robust and produces the best results, in terms of solution quality, within a reasonable amount of time. Moreover, it improves the best known results for several benchmark problems and reproduces the best results for others.