Partition Crossover Evolutionary Algorithm for the Team Orienteering Problem with Time Windows
The rapid evolution in tourism domain and new technologies make the search for the destination and site information for the tourists very difficult. In operations research field, this problem is modeled as Tourist Trip Design Problem (TTDP) which is about finding an optimal path-planning solution for tourists in order to visit multiple Points Of Interests (POIs). This paper addresses the team orienteering problem with time windows (TOPTW) that is an extension of TTDP. We apply for the first time the evolutionary algorithm based on partition crossover (EAPX) for solving the TOPTW. This approach is tested using a set of benchmarks then is compared to state-of-the-art algorithms to evaluate its performance. The results indicate the effectiveness of this method in solving the TOPTW.
KeywordsTeam orienteering problem with time windows Tourist Trip Design Problem Partition crossover Evolutionary algorithm Meta-heuristics
- Vansteenwege, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: Metaheuristics for tourist trip planning. In: Sörensen, K., Sevaux, M., Habenicht, W., Geiger, M. (eds.) Metaheuristics in the Service Industry, vol. 624, pp. 15–31. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00939-6_2CrossRefGoogle Scholar
- Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 915–922. ACM (2009)Google Scholar