ロード中...
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 |
| 主題: | |
| オンライン･アクセス: | http://www.mdpi.com/1999-4893/9/1/6 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|