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

Cur síos iomlán

Na minha lista:
Sonraí Bibleagrafaíochta
Main Authors: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
Formáid: Artigo
Teanga:Inglês
Foilsithe: MDPI AG 2016-01-01
Sraith:Algorithms
Ábhair:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
Rochtain Ar Líne:http://www.mdpi.com/1999-4893/9/1/6
Clibeanna: Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!

Míreanna Comhchosúla