Abstract
The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with a fixed limit on length or travel time, that maximises the cumulative score of the locations visited in the predefined time intervals. This paper proposes a new genetic algorithm (GA) for solving the OPTW. We use specific mutation based on the idea of insertion and shake steps taken from the well-known iterated local search method (ILS). Computational experiments are conducted on popular benchmark instances. The tests show that repetition of the mutation step for the same route during one iteration of GA can improve the solution so that it outperforms the ILS result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. Journal of Heuristics 13, 49–76 (2007)
Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)
Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., Linaz, M.: Integrating Public Transportation in Personalised Electronic Tourist Guides. Computers & Operations Research 40, 758–774 (2013)
Labadi, N., Mansini, R., Melechovsky, J., Calvo, R.W.: The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. European Journal of Operational Research 220(1), 15–27 (2012)
Kantor, M., Rosenwein, M.: The Orienteering Problem with Time Windows. Journal of the Operational Research Society 43, 629–635 (1992)
Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K., Zabielski, P.: Genetic algorithm solving orienteering problem in large networks. Frontiers in Artificial Intelligence and Applications 243, 28–38 (2012)
Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K., Zabielski, P.: A Genetic Algorithm with Grouping Selection and Searching Operators for the Orienteering Problem (under review)
Karbowska-Chilińska, J., Zabielski, P.: A Genetic Algorithm vs. Local Search Methods for Solving the Orienteering Problem in Large Networks. In: Graña, M., Toro, C., Howlett, R.J., Jain, L.C. (eds.) KES 2012. LNCS, vol. 7828, pp. 11–20. Springer, Heidelberg (2013)
Ostrowski, K., Koszelew, J.: The comparison of genetic algorithm which solve Orienteering Problem using complete an incomplete graph. Zeszyty Naukowe, Politechnika Bialostocka, Informatyka 8, 61–77 (2011)
Montemanni, R., Gambardella, L.M.: Ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences 34 (2009)
Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained elementary shortest path. Networks 51(3), 155–170 (2008)
Righini, G., Salani, M.: Dynamic programming for the orienteering problem with time windows. Technical Report 91, Dipartimento di Tecnologie dell’Informazione, Universita degli Studi Milano, Crema, Italy (2006)
Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2), 254–265 (1987)
Tsiligirides, T.: Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797–809 (1984)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: The City Trip Planner: An expert system for tourists. Expert Systems with Applications 38(6), 6540–6546 (2011)
Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers O.R. 36, 3281–3290 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Karbowska-Chilinska, J., Zabielski, P. (2014). Genetic Algorithm Solving the Orienteering Problem with Time Windows. In: Swiątek, J., Grzech, A., Swiątek, P., Tomczak, J. (eds) Advances in Systems Science. Advances in Intelligent Systems and Computing, vol 240. Springer, Cham. https://doi.org/10.1007/978-3-319-01857-7_59
Download citation
DOI: https://doi.org/10.1007/978-3-319-01857-7_59
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01856-0
Online ISBN: 978-3-319-01857-7
eBook Packages: EngineeringEngineering (R0)