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

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Format: Artigo
Langue:Inglês
Publié: MDPI AG 2016-01-01
Collection:Algorithms
Sujets:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Accès en ligne:http://www.mdpi.com/1999-4893/9/1/6
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires