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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: MDPI AG 2016-01-01
Seri Bilgileri:Algorithms
Konular:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Online Erişim:http://www.mdpi.com/1999-4893/9/1/6
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller