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

Authors:
Giovanni Righini;Matteo Salani
Affiliations:
Dipartimento di Tecnologie dell'Informazione, Universití degli Studi di Milano, Via Bramante 65, 26013 Crema (CR), Italy;Dipartimento di Tecnologie dell'Informazione, Universití degli Studi di Milano, Via Bramante 65, 26013 Crema (CR), Italy
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 11

Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Traveling Salesman Problems with Profits

Transportation Science
New dynamic programming algorithms for the resource constrained elementary shortest path problem

Networks
Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Operations Research Letters
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Discrete Optimization

Iterated local search for the team orienteering problem with time windows

Computers and Operations Research
Heuristics for the multi-period orienteering problem with multiple time windows

Computers and Operations Research
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
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
Integrating public transportation in personalised electronic tourist guides

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

Transportation Science
A detour planning algorithm in crowdsourcing systems for multimedia content gathering

Proceedings of the 5th Workshop on Mobile Video
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
A hybrid algorithm for the DNA sequencing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an exact optimization algorithm for the Orienteering Problem with Time Windows (OPTW). The algorithm is based on bi-directional and bounded dynamic programming with decremental state space relaxation. We compare different strategies proposed in the literature to guide decremental state space relaxation: our experiments on instances derived from the literature show that there is no dominance between these strategies. We also propose a new heuristic technique to initialize the critical vertex set and we provide experimental evidence of its effectiveness.