• 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
10.11606/D.3.2013.tde-08072014-122429
Document
Author
Full name
Guilherme Marques Dias
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 2013
Supervisor
Committee
Tsuzuki, Marcos de Sales Guerra (President)
Botter, Rui Carlos
Rosso Junior, Roberto Silvio Ubertino
Title in Portuguese
Heurística paralela para solução do problema de cobertura de rotas em larga escala.
Keywords in Portuguese
Logística colaborativa
Problema de cobertura de rotas
Programação paralela
Abstract in Portuguese
Empresas estão procurando reduzir seus custos e aumentar seu desempenho e competitividade. Neste cenário de redução de custos, a logística colaborativa pode ser uma aliada. Numa rede complexa, onde embarcadores muitas vezes nem sabem da existência de outros embarcadores com demandas complementares, existe um potencial de sinergia e redução de custos através da diminuição de deslocamentos de veículos sem carga, ou seja, deslocamentos para reposicionar os veículos. Visando essa redução, o Problema de Cobertura de Rotas (PCR), que tem como objetivo cobrir rotas no mínimo custo, une as demandas de frete de vários embarcadores e tenta minimizar os deslocamentos sem cargas (reposicionamentos), reduzindo assim o custo total de toda a rede dos embarcadores envolvidos. Esta pesquisa propõe um modelo e uma heurística para resolver, em grande escala através de programação paralela, uma expansão do PCR.
Title in English
Parallel heuristic for solution of lane covering problem in large scale.
Keywords in English
Collaborative logistics
Lane covering problem
Parallel programming
Abstract in English
Companies are looking to reduce costs and improve performance and competitiveness. In this cost-cutting scenario, collaborative logistics can be an ally. In a complex network where shippers often do not know of the existence of other shippers with complementary demands, there is potential for synergy and cost savings by reducing unloaded travelling of vehicles, i.e, the distance and time to reposition the vehicles'. Towards that reduction, the Lane Covering Problem (LCP), which aims to cover at least cost routeslinks the various shippers' demands of freight and tries to minimize operations without loads (repositioning), thus reducing the total cost of the entire network for involved shippers. This research proposes a model and an heuristic to solve, in large-scale through parallel programming, an expansion of the PCR.
 
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.
Diss_DiasGM.PDF (6.65 Mbytes)
Publishing Date
2014-07-15
 
WARNING: The material described below relates to works resulting from this thesis or dissertation. The contents of these works are the author's responsibility.
  • Dias, G. M., and Tsuzuki, M. S. G. System for Shippers Collaboration [doi:10.3182/20100701-2-PT-4011.00042]. In 10th IFAC Workshop on Intelligent Manufacturing Systems, Lisboa, 2010. 10th IFAC Workshop on Intelligent Manufacturing Systems (Preprints). : IFAC, 2010.
  • Dias, G. M., e Tsuzuki, M. S. G. Modelagem para Colaboração entre Embarcadores. In Congresso SAE Brasil 2010, São Paulo, 2010. Anais do Congresso SAE Brasil 2010.São Paulo : SAE Brasil, 2010.
All rights of the thesis/dissertation are from the authors
Centro de Informática de São Carlos
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2019. All rights reserved.