Submitted by Anonymous (not verified) on Thu, 2017-01-19 12:34
The touristic trip planning problem can be <br> considered as a Multi Constrained Team Orienteering <br> Problem with Time Windows (MCTOPTW). The MCTOPTW <br> is characterized with a set of points of interest (POI), each <br> having a score, a time window and some attributes such as the <br> type or entry fee. The maximum number of POIs of certain <br> types that can be included into the itinerary is limited. A <br> tourist can visit the POIs during their respective time windows. <br> The objective is to visit the points that have the highest scores <br> during specified periods of time. This paper proposes a Tabu <br> Search approach for solving the MCTOPTW problem. To <br> explore the neighborhood the moves Insert, Replace and Swap <br> are applied. Additionally, the algorithm employs a tabu list, a <br> perturbation and a diversification mechanism. The algorithm <br> is evaluated on benchmark instances from the literature and its <br> performance is compared to the state of the art results.
Information and Communication Technology
12th International Conference on HybridIntelligent Systems
IEEE Computer Society
300 - 305
K. Sylejmani, J. Dorn, N. Musliu: <br>"<i><a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6421351&punumber%3D6409521%26sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A6421298%29%26pageNumber%3D3" target="_blank" class="publist">A Taboo Search approach for solving Multi Constrained Team Orienteering Problem for application in touristic trip planning</a></i>"; <br>in: "<i>12th International Conference on HybridIntelligent Systems</i>", issued by: IEEE; IEEE Computer Society, 2012, ISBN: 978-1-4673-5114-0, 300 - 305.<br><br> <a href="https://publik.tuwien.ac.at/showentry.php?ID=212749&lang=2" class="publist"><i>More information</i></a><br><br>