A constraint programming approach for the team orienteering problem with time windows
نویسندگان
چکیده
منابع مشابه
The Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملThe Team Orienteering Problem with Capacity Constraint and Time Window
The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a t...
متن کاملEfficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows
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 transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and ...
متن کاملA heuristic scheme for the Cooperative Team Orienteering Problem with Time Windows
The Cooperative Orienteering Problem with Time Windows (COPTW)is a class of problems with some important applications and yet has received relatively little attention. In the COPTW a certain number of team members are required to collect the associated reward from each customer simultaneously and cooperatively. This requirement to have one or more team members simultaneously available at a vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2017
ISSN: 0360-8352
DOI: 10.1016/j.cie.2017.03.017