An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows

  • Aldy GunawanEmail author
  • Hoong Chuin Lau
  • Kun Lu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9026)


The Orienteering Problem with Time Windows (OPTW) is a variant of the Orienteering Problem (OP). Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, which is based on several LocalSearch operations, such as swap, 2-opt, insert and replace. We also implement the combination between AcceptanceCriterion and Perturbation mechanisms to control the balance between diversification and intensification of the search. In Perturbation, Shake strategy is introduced. The computational results obtained by our proposed algorithm are compared against optimal solutions or best known solution values obtained by state-of-the-art algorithms. We show experimentally that our proposed algorithm is effective on well-known benchmark instances available in the literature. It is also able to improve the best known solution of some benchmark instances.


Orienteering problem Time windows Iterated local search 



This research is supported by Singapore National Research Foundation under its International Research Centre @ Singapore Funding Initiative and administered by the IDM Programme Office, Media Development Authority (MDA).


  1. 1.
    Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)CrossRefGoogle Scholar
  2. 2.
    Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)CrossRefzbMATHGoogle Scholar
  3. 3.
    Labadie, N., Mansini, R., Melechovskỳ, J., Calvo, R.W.: The team orienteering problem with time windows: an LP-based granular variable neighborhood search. Eur. J. Oper. Res. 220(1), 15–27 (2012)CrossRefzbMATHGoogle Scholar
  4. 4.
    Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Operat. Res. 36(12), 3281–3290 (2009)CrossRefzbMATHGoogle Scholar
  5. 5.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  6. 6.
    Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629–635 (1992)CrossRefzbMATHGoogle Scholar
  7. 7.
    Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36(4), 1191–1203 (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Boland, N., Dethridge, J., Dumitrescu, I.: Accelerated label setting algorithms for the elementary resource constrained shortest path. Oper. Res. Lett. 34(1), 58–68 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Montemanni, R., Gambardella, L.M.: Ant colony system for team orienteering problem with time windows. Found. Comput. Decis. Sci. 34(4), 287–306 (2009)Google Scholar
  10. 10.
    Labadie, N., Mansini, R., Melechovskỳ, J., Calvo, R.W.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heuristics 17(6), 729–753 (2011)CrossRefzbMATHGoogle Scholar
  11. 11.
    Montemanni, R., Weyland, D., Gambardella, L.M.: An enhanced ant colony system for the team orienteering problem with time windows. In: Proceedings of 2011 International Symposium on Computer Science and Society (ISCCS), pp. 381–384 (2011)Google Scholar
  12. 12.
    Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 217(1), 94–107 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Hu, Q., Lim, A.: An iterative three-component heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 232(2), 276–286 (2014)CrossRefzbMATHGoogle Scholar
  14. 14.
    Solomon, M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Cordeau, J.F., Grendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Information SystemsSingapore Management UniversitySingaporeSingapore

Personalised recommendations