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

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Fformat: Artigo
Iaith:Inglês
Cyhoeddwyd: MDPI AG 2016-01-01
Cyfres:Algorithms
Pynciau:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Mynediad Ar-lein:http://www.mdpi.com/1999-4893/9/1/6
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg