The Multiconstraint Team Orienteering Problem with Multiple 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...
متن کامل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 ...
متن کاملIterated local search heuristic for the team orienteering problem with time windows
Tourists have the difficult task to schedule their holiday activities in such a way that they enjoy their holiday as much as possible, while keeping the opening times and exact locations of attractions in mind. This task can be formulated as the team orienteering problem with time windows (TOPTW). The TOPTW uses a list of locations as input, together with their opening times and appreciation sc...
متن کاملEfficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows
Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW) seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2013
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.1110.0377