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...
Sparad:
Huvudupphovsman: | |
---|---|
Övriga upphovsmän: | |
Materialtyp: | Dissertação |
Språk: | por |
Publicerad: |
Universidade Federal do Rio Grande do Norte
|
Ämnen: | |
Länkar: | https://repositorio.ufrn.br/jspui/handle/123456789/18112 |
Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|