Φορτώνει......
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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
MDPI AG
2016-01-01
|
| Σειρά: | Algorithms |
| Θέματα: | |
| Διαθέσιμο Online: | http://www.mdpi.com/1999-4893/9/1/6 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|