Heuristics for the multi-period orienteering problem with multiple time windows

  • Authors:

  • Fabien Tricoire;Martin Romauch;Karl F. Doerner;Richard F. Hartl

  • Affiliations:

  • Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria and Salzburg Research Forschungsgesellschaft, Jakob-Haringer Strasse 5/III, 5020 Salzburg, Au ...;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms.