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

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Médium: Artigo
Jazyk:Inglês
Vydáno: MDPI AG 2016-01-01
Edice:Algorithms
Témata:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
On-line přístup:http://www.mdpi.com/1999-4893/9/1/6
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky