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:
- Authors retain copyright and grant TRANSPORTES the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors may enter into separate, additional contractual arrangements for the non-exclusive distribution of this journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in TRANSPORTES.
- Authors are allowed and encouraged to post their work online (e.g., in institutional repositories or on their website) after publication of the article. Authors are encouraged to use links to TRANSPORTES (e.g., DOIs or direct links) when posting the article online, as TRANSPORTES is freely available to all readers.
- Authors have secured all necessary clearances and written permissions to published the work and grant copyright under the terms of this agreement. Furthermore, the authors assume full responsibility for any copyright infringements related to the article, exonerating ANPET and TRANSPORTES of any responsibility regarding copyright infringement.
- Authors assume full responsibility for the contents of the article submitted for review, including all necessary clearances for divulgation of data and results, exonerating ANPET and TRANSPORTES of any responsibility regarding to this aspect.