An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows

Authors:
Nacima Labadi;Jan Melechovský;Roberto Wolfler Calvo
Affiliations:
Institute Charles Delaunay, University of Technology of Troyes, Troyes Cedex, France;Institute Charles Delaunay, University of Technology of Troyes, Troyes Cedex, France;Laboratoire d'Informatique de Paris-Nord, University Paris 13, Villetaneuse, France
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 5
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming

Computers and Operations Research
Iterated local search for the team orienteering problem with time windows

Computers and Operations Research
Evolutionary local search for the super-peer selection problem and the p-hub median problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

The orienteering problem (OP) consists in finding an elementary path over a subset of vertices. Each vertex has associated a profit that is collected on the visitor's first visit. The objective is to maximize the collected profit with respect to a limit on the path's length. The team orienteering problem (TOP) is an extension of the OP where a fixed number m of paths must be determined. This paper presents an effective hybrid metaheuristic to solve both the OP and the TOP with time windows. The method combines the greedy randomized adaptive search procedure (GRASP) with the evolutionary local search (ELS). The ELS generates multiple distinct child solutions using a mutation mechanism and a local search. The GRASP provides multiple starting solutions to the ELS. The method is able to improve several best known results on available benchmark instances.