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ón completa

Guardado en:
Detalles Bibliográficos
Autores principales: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Formato: Artigo
Lenguaje:Inglês
Publicado: MDPI AG 2016-01-01
Colección:Algorithms
Materias:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Acceso en línea:http://www.mdpi.com/1999-4893/9/1/6
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares