Abstract
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with a limited number of paths. We propose two algorithms, Iterated Local Search and a hybridization of Simulated Annealing and Iterated Local Search (SAILS), to solve the TOPTW. As indicated in multiple research works on algorithms for the OP and its variants, determining appropriate parameter values in a statistical way remains a challenge. We apply Design of Experiments, namely factorial experimental design, to screen and rank all the parameters thereby allowing us to focus on the parameter search space of the important parameters. The proposed algorithms are tested on benchmark TOPTW instances. We demonstrate that well-tuned ILS and SAILS lead to improvements in terms of the quality of the solutions. More precisely, we are able to improve 50 best known solution values on the available benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Adenso-Diaz B and Laguna M (2006). Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research 54(1):99–114.
Cordeau J, Grendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119.
Cura T (2014). An artificial bee colony algorithm approach for the team orienteering problem with time windows. Computers and Industrial Engineering 74:270–290.
Duque D, Lozano L and Medaglia A (2015). Solving the orienteering problem with time windows via the pulse framework. Computers and Operations Research 54:168–176.
Eiben AE and Smit SK (2012). Evolutionary algorithm parameters and methods to tune them. In Hamadi Y, Monfroy E and Saubion F (Eds.) Autonomous Search. Springer: Berlin, pp. 15–36.
Eiben AE, Michalewicz Z, Schoenauer M and Smith JE (2007). Parameter control in evolutionary algorithms. In Lobo FG, Lima CF and Michalewicz Z (Eds.) Parameter Setting in Evolutionary Algorithms. Springer: Berlin, pp. 19–46.
Eiben AE, Hinterding R and Michalewicz Z (1999). Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2):124–141.
Gendreau M, Laporte G and Semet F (1998). A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research 106(2–3):539–545.
Goldberg DE (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley: Reading.
Golden B, Levy L and Vohra R (1987). The orienteering problem. Naval Research Logistics 34(3):307–318.
Gunawan A, Lau HC and Lindawati (2011). Fine-tuning algorithm parameters using the design of experiments approach. In Coello CAC (Ed.) Proceedings of the 5th International Conference on Learning and Intelligent Optimization (LION5), Vol. 6683 of Lecture Notes in Computer Science. Springer: Berlin, pp. 278–292.
Gunawan A, Lau HC and Lu K (2015a). SAILS: hybrid algorithm for the team orienteering problem with time windows. In Proceedings of 7th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2015), Prague, Czech Republic, pp. 276–295.
Gunawan A, Lau HC and Lu K (2015b). An iterated local search algorithm for solving the orienteering problem with time windows. In Ochoa G and Chicano F (Eds.) Proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoStar 2015), Vol. 9026 of Lecture Notes in Computer Science, 8–10 April 2015, Copenhagen, Denmark. Springer: Berlin, pp. 61–73.
Gunawan A, Lau HC and Vansteenwegen P (2016). Orienteering problem: a survey of recent variants, solution approaches and applications. European Journal of Operational Research 255(2):315–332.
Hu Q and Lim A (2014). An iterative three-component heuristic for the team orienteering problem with time windows. European Journal of Operational Research 232(2):276–286.
Hutter F, Hoos, Leyton-Brown K and Stützle T (2009). ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36:267–306.
Johnson SM (1963). Generation of permutations by adjacent transposition. Mathematics of Computation.1717(83):282–285.
Labadie N, Mansini R, Melechovskỳ J and Calvo RW (2011). Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. Journal of Heuristics 17(6):729–753.
Labadie N, Mansini R, Melechovskỳ R and Calvo J (2012). The team orienteering problem with time windows: an LP-based granular variable neighborhood search. European Journal of Operational Research 220(1):15–27.
Lin S-W and Yu VF (2012). A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research 217(1):94–107.
Lourenço H, Martin O and Stützle T (2003). Iterated local search. In Glover FW and Kochenberger GA (Eds.) Handbook of Metaheuristics. Springer: Berlin, pp. 320–353.
Montemanni R and Gambardella LM (2009). Ant colony system for team orienteering problem with time windows. Foundations of Computing and Decision Sciences 34(4):287–306.
Montemanni R, Weyland D and Gambardella LM (2011). 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), Kota Kinabalu, Malaysia, pp. 381–384.
Montgomery D (2005). Design and Analysis of Expeirments, 6th Edn. Wiley: London.
Righini G and Salani M (2009). Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers and Operations Research 36(4):1191–1203.
Solomon M (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2):254–265.
Souffriau W, Vansteenwegen P, Berghe G and van Oudheusden D (2013). The multiconstraint team orienteering problem with multple time windows. Transportation Science 47(1):53–63.
Stützle T, López-Ibáñez M, Pellegrini P, Maur M, Montes de Oca M, Birattari M and Dorigo M (2012). Parameter adaptation in ant colony optimization. In Hamadi Y, Monfroy E and Saubion F (Eds.) Autonomous Search. Springer: Berlin, pp. 191–215.
Tricoire F, Romauch M, Doerner KF and Hartl RF (2010). Heuristics for the multi-period orienteering problem with multiple time windows. Computers and Operations Research 37(2):351–367.
Tsiligirides T (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9):797–809.
Vansteenwegen P, Souffriau W, Vanden Berghe G and Van Oudheusden D (2009). Iterated local search for the team orienteering problem with time windows. Computers and Operations Research 36(12):3281–3290.
Vansteenwegen P, Souffriau W and Van Oudheusden D (2011). The orienteering problem: a survey. European Journal of Operational Research 209(1):1–10.
Acknowledgements
This research project is funded by National Research Foundation Singapore under its Corp Lab @ University scheme and Fujitsu Limited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gunawan, A., Lau, H.C., Vansteenwegen, P. et al. Well-tuned algorithms for the Team Orienteering Problem with Time Windows. J Oper Res Soc 68, 861–876 (2017). https://doi.org/10.1057/s41274-017-0244-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/s41274-017-0244-1