載入...
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...
Na minha lista:
| Main Authors: | , , , , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
MDPI AG
2016-01-01
|
| 叢編: | Algorithms |
| 主題: | |
| 在線閱讀: | http://www.mdpi.com/1999-4893/9/1/6 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|