Algoritmo treansgenético na solução do problema do Caixeiro Viajante
The Traveling Purchaser Problem is a variant of the Traveling Salesman Problem, where there is a set of markets and a set of products. Each product is available on a subset of markets and its unit cost depends on the market where it is available. The objective is to buy all the products, departing a...
שמור ב:
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | Dissertação |
| שפה: | por |
| יצא לאור: |
Universidade Federal do Rio Grande do Norte
|
| נושאים: | |
| גישה מקוונת: | https://repositorio.ufrn.br/jspui/handle/123456789/18112 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|