Pantheon Institutional repository
Collect, preserve and disseminate digital academic production in all areas of knowledge.
Comprise the assets of the repository, in addition to theses and dissertations at UFRJ, scientific articles, electronic books, book chapters and papers presented at events for teachers, researchers, administrative staff and students of master's and doctoral degrees.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/1588| Type: | Relatório |
| Title: | Many-visits vehicle routing problems |
| Author(s)/Inventor(s): | Szwarcfiter, Jayme Luiz |
| Abstract: | Consideramos problemas de roteamento com restrições, onde cada cidade deve ser visitada, possivelmente, várias vezes. Descrevemos dois algoritmos cujas complexidades são expressões exponenciais no número de cidades, porém não no número de visitas. Além disso, propomos um critério de classificação de algoritmos para problemas gerais de scheduling/roteamento com múltiplas visitas. |
| Abstract: | We consider constrained routing problems where each city is to be visited possibly many times. Two algorithms are given having complexities which are exponentials in the number of cities, but not i the number of visits. I addition, a critria is proposed for classifying algorithms for general many-visits routhing/scheduling problems. |
| Keywords: | Algoritmos Escalonamento Algorithms |
| Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
| In: | Relatório Técnico NCE |
| Issue: | 1388 |
| Issue Date: | 31-Oct-1988 |
| Publisher country: | Brasil |
| Language: | eng |
| Right access: | Acesso Aberto |
| Citation: | SZWARCFITER, J. L. Many-visits vehicle routing problems. Rio de Janeiro: NCE, UFRJ, 1988. 15 p. (Relatório Técnico, 13/88) |
| Appears in Collections: | Relatórios |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 13_88_000040358.pdf | 2.28 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.