Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows

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...

Full description

Bibliographic Details
Main Authors: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Format: Article
Language:English
Published: MDPI AG 2016-01-01
Series:Algorithms
Subjects:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Online Access:http://www.mdpi.com/1999-4893/9/1/6

Internet

http://www.mdpi.com/1999-4893/9/1/6

Similar Items