期刊
COMPUTERS & OPERATIONS RESEARCH
卷 62, 期 -, 页码 36-50出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2015.03.016
关键词
Time Dependent Team Orienteering; Problem with Time Windows; Tourist Trip Design Problem; Iterated Local Search; Clustering
类别
资金
- EU [288094]
- EU CIP [621133]
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transportation. The main objective of this problem is to select POIs that match tourist preferences, taking into account a multitude of parameters and constraints while respecting the time available for sightseeing in a daily basis and integrating public transportation to travel between POIs (Tourist Trip Design Problem, TTDP). TDTOPTW is NP-hard while almost the whole body of the related literature addresses the non-time dependent version of the problem. The only TDTOPTW heuristic proposed so far is based on the assumption of periodic transit service schedules. Herein, we propose efficient cluster-based heuristics for the TDTOPTW which yield high quality solutions, take into account time dependency in calculating travel times between POIs and make no assumption on periodic service schedules. The validation scenario for our prototyped algorithms involved the transit network and real POI datasets compiled from the metropolitan area of Athens (Greece). Our TTDP algorithms handle arbitrary (i.e. determined at query time) rather than fixed start/end locations for derived tourist itineraries. (C) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据