• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.45.1996.tde-20210729-013149
Document
Author
Full name
Marko Loparic
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 1995
Supervisor
Title in Portuguese
Uma aplicação do método de branch-and-cut a um problema de roteamento de veiculos
Keywords in Portuguese
Combinatória
Programação Matemática
Abstract in Portuguese
O problema de roteamento de veiculos e o problema de determinar a melhor rota para que veiculos levem mercadoria a clientes geograficamente dispersos, respeitando restricoes a respeito da capacidade de transporte dos veiculos e de tempo maximo de viagem. Nesse trabalho mostramos uma implementacao de um algoritmo branch-and-cut para esse problema. Nosso algoritmo foi testado com dados de um problema real de transporte de funcionarios da petrobras que trabalham nas plataformas de petroleo da bacia de campos. Os resultados mostram-se superiores aos obtidos anteriormente por metodos heuristicos
Title in English
not available
Abstract in English
not available
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
LoparicMarko.pdf (12.02 Mbytes)
Publishing Date
2021-07-29
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.