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

Descrizione completa

Salvato in:
Dettagli Bibliografici
Autori principali: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Natura: Artigo
Lingua:Inglês
Pubblicazione: MDPI AG 2016-01-01
Serie:Algorithms
Soggetti:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Accesso online:http://www.mdpi.com/1999-4893/9/1/6
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !

Documenti analoghi