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

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Format: Artigo
Idioma:Inglês
Publicat: MDPI AG 2016-01-01
Col·lecció:Algorithms
Matèries:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Accés en línia:http://www.mdpi.com/1999-4893/9/1/6
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars