O problema da roteirização periódica de veículos
DOI:
https://doi.org/10.14295/transportes.v16i1.8Abstract
Este artigo trata do problema de roteirização periódica, uma generalização do problema clássico de roteirização de veículos. Neste problema, os pontos a serem atendidos podem ter diferentes freqüências de visitas e a roteirização deve considerar um período de planejamento. Portanto, é preciso decidir quais são os melhores dias de visita para cada ponto (respeitando sua freqüência de visitas), para que a roteirização seja otimizada para todo o horizonte de planejamento. Este problema ocorre no contexto da logística inbound na indústria automobilística. Neste caso, não só os roteiros de coleta devem ser determinados como também os dias em que cada fornece- dor pode ser visitado, dado que os diferentes fornecedores podem ter diferentes freqüências. Com a finalidade de explorar novas abor- dagens para este tipo de problema de maneira que houvesse um aumento na qualidade de soluções e diminuição do tempo de proces- samento computacional, são propostas três estratégias heurísticas de solução, baseadas em inserção, GRASP e algoritmos genéticos. As estratégias foram implementadas e testadas para problemas encontrados na literatura, bem como problemas gerados aleatoriamente.
Abstract: This article deals with the period vehicle routing problem, which can be viewed as a generalization of the classical vehicle routing problem. In this problem, points to be serviced may have different frequencies and the routing is accomplished over a given planning horizon. Thus, one must decide which are the best days to visit each point (respecting its given frequency), so that the routing over the overall planning horizon is optimized. This problem arises in the context of inbound logistics in the automotive industry. In this case, pick-up routes should be determined as well as the days each supplier must be visited, given that the different suppliers may have different frequencies. To explore new approaches to this problem, aiming to improved solutions and reduced CPU time, three new heuristics are proposed, based on GRASP and genetic algorithm. The heuristics were implemented and tested against problems found in the literature, as well as in randomly generated problems.
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, and to be adapted for non-commercial purposes, provided appropriate credit is given and any derivative works are distributed under the same terms.
- 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.
