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
|
Предметы: | |
Online-ссылка: | https://repositorio.ufrn.br/jspui/handle/123456789/18112 |
Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|