Iterated local search for the team orienteering problem with time windows

Authors:
Pieter Vansteenwegen;Wouter Souffriau;Greet Vanden Berghe;Dirk Van Oudheusden
Affiliations:
Centre for Industrial Management, Katholieke Universiteit Leuven, Celestijnenlaan 300A-bus 2422, 3001 Leuven, Belgium;Centre for Industrial Management, Katholieke Universiteit Leuven, Celestijnenlaan 300A-bus 2422, 3001 Leuven, Belgium and Information Technology, Katholieke Hogeschool Sint-Lieven, Gebroeders Desm ...;Information Technology, Katholieke Hogeschool Sint-Lieven, Gebroeders Desmetstraat 1, 9000 Gent, Belgium;Centre for Industrial Management, Katholieke Universiteit Leuven, Celestijnenlaan 300A-bus 2422, 3001 Leuven, Belgium
Venue:
Computers and Operations Research
Year:
2009

Citing 15
Cited 14

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

Operations Research
The selective travelling salesman problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
A heuristic for the multiple tour maximum collection problem

Computers and Operations Research
Resource-constrained geometric network optimization

Proceedings of the fourteenth annual symposium on Computational geometry
Traveling Salesman Problems with Profits

Transportation Science
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Transportation Science
On approximating a geometric prize-collecting traveling salesman problem with time windows

Journal of Algorithms
Metaheuristics for the team orienteering problem

Journal of Heuristics
A TABU search heuristic for the team orienteering problem

Computers and Operations Research
Ants can solve the team orienteering problem

Computers and Industrial Engineering
New dynamic programming algorithms for the resource constrained elementary shortest path problem

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

Computers and Operations Research
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

A Mobile Tourist Decision Support System for Small Footprint Devices

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Tourist trip planning functionalities: state-of-the-art and future

ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Personalized tourist route generation

ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
The City Trip Planner: An expert system for tourists

Expert Systems with Applications: An International Journal
Hybrid approach for the public transportation time dependent orienteering problem with time windows

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Adaptive large neighborhood search for service technician routing and scheduling problems

Journal of Scheduling
Integrating public transportation in personalised electronic tourist guides

Computers and Operations Research
The Multiconstraint Team Orienteering Problem with Multiple Time Windows

Transportation Science
A genetic algorithm vs. local search methods for solving the orienteering problem in large networks

KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications
Tour suggestion for outdoor activities

W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
A genetic algorithm for the TOPdTW at operating rooms

ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
Multi-day and multi-stay travel planning using geo-tagged photos

Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
Review: Mobile recommender systems in tourism

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

A personalised electronic tourist guide assists tourists in planning and enjoying their trip. The planning problem that needs to be solved, in real-time, can be modelled as a team orienteering problem with time windows (TOPTW). In the TOPTW, a set of locations is given, each with a score, a service time and a time window. The goal is to maximise the sum of the collected scores by a fixed number of routes. The routes allow to visit locations at the right time and they are limited in length. The main contribution of this paper is a simple, fast and effective iterated local search meta-heuristic to solve the TOPTW. An insert step is combined with a shake step to escape from local optima. The specific shake step implementation and the fast evaluation of possible improvements, produces a heuristic that performs very well on a large and diverse set of instances. The average gap between the obtained results and the best-known solutions is only 1.8% and the average computation time is decreased with a factor of several hundreds. For 31 instances, new best solutions are computed.