Uma aplicação da busca tabu para o problema de carregamento no transporte de carga parcelada
DOI:
https://doi.org/10.4237/transportes.v20i1.554Abstract
Este trabalho trata do problema de carregamento em redes de distribuição de carga parcelada. O mesmo consiste na definição dos fluxos de cargas desde seus terminais de origem até seus destinos, a um mínimo custo, tendo como principal dado adicional de entrada uma rede de transporte com uma estrutura similar a uma rede hub-and-spoke. Mais especificamente, o problema trata do planejamento dos carregamentos a serem realizados em cada um dos terminais levando-se em conta cada uma das cargas que devem ser transportadas, definindo-se o caminho que cada despacho deve percorrer até chegar ao seu destino. Esse problema é modelado matematicamente e, dada a dificuldade para solução de problemas de tamanho igual ao encontrado na prática, é proposta uma heurística baseada em busca tabu para sua solução. Experimentos computacionais mostram que a heurística proposta permite resolver de forma eficiente instâncias reais de uma empresa transportadora no Brasil.
ABSTRACT: This paper deals with the cargo loading problem in the context of distribution networks for less-than-truckload (LTL) trucking company. It consists of determining the flows of LTL freights from their origins to the destination terminals, seeking for a minimum cost, having a hub-and-spoke network topology as a data entry to the problem. More specifically, the problem deals with the planning of loads to be done at each terminal, taking into account each LTL freight that needs to be transported, defining the path that each good needs to follow to reach its destination. A new mathematical model is proposed, and, since real world problems are very hard to solve, a heuristic based on tabu search is also developed. Computational experiments show that our heuristic can effectively solve real-world instances from a trucking company in Brazil.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Authors who submit papers for publication by TRANSPORTES agree to the following terms:
- The authors retain the copyright and grant Transportes the right of first publication of the manuscript, without any financial charge, and waive any other remuneration for its publication by ANPET.
- Upon publication by Transportes, the manuscript is automatically licensed under the Creative Commons License CC BY 4.0 license. This license permits the work to be shared with proper attribution to the authors and its original publication in this journal.
- Authors are authorized to enter into additional separate contracts for the non-exclusive distribution of the version of the manuscript published in this journal (e.g., publishing in an institutional repository or as a book chapter), with recognition of the initial publication in this journal, provided that such a contract does not imply an endorsement of the content of the manuscript or the new medium by ANPET.
- Authors are permitted and encouraged to publish and distribute their work online (e.g., in institutional repositories or on their personal websites) after the editorial process is complete. As Transportes provides open access to all published issues, authors are encouraged to use links to the DOI of their article in these cases.
- Authors guarantee that they have obtained the necessary authorization from their employers for the transfer of rights under this agreement, if these employers hold any copyright over the manuscript. Additionally, authors assume all responsibility for any copyright infringements by these employers, releasing ANPET and Transportes from any responsibility in this regard.
- Authors assume full responsibility for the content of the manuscript, including the necessary and appropriate authorizations for the disclosure of collected data and obtained results, releasing ANPET and Transportes from any responsibility in this regard.
