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

Descrición completa

Gardado en:
Detalles Bibliográficos
Main Authors: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Formato: Artigo
Idioma:Inglês
Publicado: MDPI AG 2016-01-01
Series:Algorithms
Assuntos:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Acceso en liña:http://www.mdpi.com/1999-4893/9/1/6
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares