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

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
मुख्य लेखकों: Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou, Nikolaos Vathis
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: MDPI AG 2016-01-01
श्रृंखला:Algorithms
विषय:
Iterated Local Search
Simulated Annealing
Team Orienteering Problem
Arc Orienteering Problem
ऑनलाइन पहुंच:http://www.mdpi.com/1999-4893/9/1/6
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन