Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
