Wordt geladen...
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...
Bewaard in:
| Hoofdauteurs: | , , , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI AG
2016-01-01
|
| Reeks: | Algorithms |
| Onderwerpen: | |
| Online toegang: | http://www.mdpi.com/1999-4893/9/1/6 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|