Lanean...
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...
Gorde:
| Egile Nagusiak: | , , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2016-01-01
|
| Saila: | Algorithms |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.mdpi.com/1999-4893/9/1/6 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|