Загрузка...
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 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|